Hi Guys, I have a bit of a difficult algorithm question, I can't find any suitable algorithm from a lot of searching, so I am hoping that someone here on stackoverflow might know the answer. I have a set of x,y coordinates for a vehicle as it moves through a 2D space, the coordinates are recorded at "decision points" in the time period...
(Re-written question, please see history for original). The question is right there in the title. Why is there no managed MD5 implementation in the .NET framework? I'm specifically talking about a purely managed code implementation of the MD5 algorithm, which does not exist within the .NET framework. Within the System.Security.Crypto...
I remember eclipse and idea have this template to automatically create an object's hashCode based on its attributes. One of the strategies if a number and a string is used is something like this. return stringValue.hashCode() + intValue * 32; Ooor something like that. I don't have nor eclipse or idea at hand and I would like to cr...
I want to do, in Perl, the equivalent of the following Ruby code: class Foo MY_CONST = { 'foo' => 'bar', 'baz' => { 'innerbar' => 'bleh' }, } def some_method a = MY_CONST[ 'foo' ] end end # In some other file which uses Foo... b = Foo::MY_CONST[ 'baz' ][ 'innerbar' ] That is, I just want to declare a ...
I've always used a proper per-entry salt string when hashing passwords for database storage. For my needs, storing the salt in the DB next to the hashed password has always worked fine. However, some people recommend that the salt be stored separately from the database. Their argument is that if the database is compromised, an attacker...
I've the file path. How can I get the MD5 hash of it? Thanks ...
I need a secure (cryptographic) hash function with the following properties: Can be coded in as few lines as possible (in R5RS Scheme). Hopefully under 50. Memory and CPU performance within reason for password-length data. (e.g. it does not have to be super efficient or create hashes for millions of bytes of data) Most secure hash fu...
For demonstration-purposes, what are a couple examples of strings that collide when hashed? MD5() is a relatively standard hashing-option, so this will be sufficient. ...
I have an instance of dict with ints, floats, strings as keys, but the problem is when there are a as int and b as float, and float(a) == b, then their hash values are the same, and thats what I do NOT want to get because I need unique hash vales for this cases in order to get corresponding values. Example: d = {1:'1', 1.0:'1.0', '1':1...
Hello everyone, One of our website has URL like this : exemple.oursite.com. We decided to move our site with an URL like this www.oursite.com/exemple. To do this, we wrote a rewrite rule in our Apache server that redirect to our new URL with a code 301. Many websites link to us with URLs of the form exemple.oursite.com/#id=23. The pro...
Does anyone know of an optimized way of detecting a 37 bit sequence in a chunk of binary data that is optimal. Sure I can do a brute force compare using windowing (just compare starting with index 0+next 36 bits, increment and loop until i find it) but is there a better way? Maybe some hashing search that returns a probability that the s...
Is there an easy way to convert a Nokogiri XML document to a Hash? Something like Rails' Hash.from_xml. ...
I want to send function names from a weak embedded system to the host computer for debugging purpose. Since the two are connected by RS232, which is short on bandwidth, I don't want to send the function's name literally. There are some 15 chars long function names, and I sometimes want to send those names at a pretty high rate. The solu...
I need to create the hash of a the html of a webpage (from its URL) using SHA1 or MD5 in java, but I don't know how to do it... can you help me? ...
I know that say given a md5/sha1 of a value, that reducing it from X bits (ie 128) to say Y bits (ie 64 bits) increases the possibility of birthday attacks since information has been lost. Is there any easy to use tool/formula/table that will say what the probability of a "correct" guess will be when that length reduction occurs (compare...
Ahoy Stack Overflow! This be mai first post... I'm attempting to identify users with a salted unique public key. Algorithm - Should I use uniqid(), sha256, sha512, something else? All hashes will be salted. NIST recommended SHA256, but I like recommendations from geeks/scientists like me. Generation - Does hash(SALT + AUTO_INCREME...
Hi everyone, here's my problem: User inputs a password in the Options section of the program. The password is hashed (MD5) and stored in the registry. The program is ran, an Excel spreadsheet is created, and password protected using the hashed value that is stored in the registry. The user opens the spreadsheet, and is prompted to ente...
Someone told me that he has seen software systems that would accept MD5 encrypted passwords (through various integrations with other systems), decrypt them, and store them in the systems own database using it's own algorithm. Is that possible? I thought that it wasn't possible (feasible) to decrypt MD5 hashes. I know there are MD5 dic...
How do I append hash a to hash b in Perl without using a loop? ...
When I am encrypting 23 using MD5 encryption I am getting 37693cfc748049e45d87b8c7d8b9aacd this 32-character long string which will always be static for 23. I want the same kind of mechanism but that should generate 18 or less (like: 122ff1e4883358b6) characters long string instead 32. How I can do that in C#, is there any shorter ver...