Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Google has released http://code.google.com/p/cityhash/ recently. It is a variant of MurmurHash,
http://sites.google.com/site/murmurhash/
As it is mentioned that it can’t be used for cryptography, in which all possible interesting cases for using it as an alternative for existing hash?
Looking for algorithms that can use this hash implementation, similar to http://www.partow.net/programming/hashfunctions/
MurmurHash (and by extension, CityHash) are designed as general-purpose, non-secure hashes. The most common use for them is as a key in a hashtable – but other applications, such as Bloom Filters, also exist.
The main criteria for such hashes is that they be fast to generate, yet well distributed, to avoid hotspots in hashtables and the like. The first part rules out slower secure hashing functions, and the second (avoiding hotspots) rules out most trivial functions such as summing or xoring bytes together, which makes the design of a fast but well-distributed hash quite challenging.