Why are XOR often used in java hashCode() but another bitwise operators are used rarely?

by

Of all bit-operations XOR has the best bit shuffling properties.

This truth-table explains why:

A B AND
0 0  0
0 1  0
1 0  0
1 1  1

A B OR
0 0  0
0 1  1
1 0  1
1 1  1

A B XOR
0 0  0
0 1  1
1 0  1
1 1  0

As you can see for AND and OR do a poor job at mixing bits.

OR will on average produce 3/4 one-bits. AND on the other hand will produce on average 3/4 null-bits. Only XOR has an even one-bit vs. null-bit distribution. That makes it so valuable for hash-code generation.

Remember that for a hash-code you want to use as much information of the key as possible and get a good distribution of hash-values. If you use AND or OR you’ll get numbers that are biased towards either numbers with lots of zeros or numbers with lots of ones.

More Related Contents:

  1. Are mutable hashmap keys a dangerous practice?
  2. Is it possible to decrypt MD5 hashes?
  3. How can I generate an MD5 hash in Java?
  4. How does password salt help against a rainbow table attack?
  5. Salting Your Password: Best Practices? [closed]
  6. Good Hash Function for Strings
  7. Is it safe to ignore the possibility of SHA collisions in practice?
  8. Probability of SHA1 collisions
  9. Why is XOR the default way to combine hashes?
  10. Are there any SHA-256 javascript implementations that are generally considered trustworthy? [closed]
  11. Quick and Simple Hash Code Combinations
  12. Is there an MD5 Fixed Point where md5(x) == x?
  13. How come MD5 hash values are not reversible?
  14. Is calculating an MD5 hash less CPU intensive than SHA family functions?
  15. When is CRC more appropriate to use than MD5/SHA1?
  16. How long to brute force a salted SHA-512 hash? (salt provided)
  17. Can two different strings generate the same MD5 hash code?
  18. How are hash functions like MD5 unique?
  19. Why is ‘397’ used for ReSharper GetHashCode override?
  20. Is MD5 still good enough to uniquely identify files?
  21. How can it be impossible to “decrypt” an MD5 hash? [duplicate]
  22. How to create a HashMap with two keys (Key-Pair, Value)?
  23. Is it possible to decrypt MD5 hashes?
  24. Is there hash code function accepting any object type?
  25. How to “EXPIRE” the “HSET” child key in redis?
  26. Why are 5381 and 33 so important in the djb2 algorithm?
  27. node.js hash string?
  28. Hashing with SHA1 Algorithm in C#
  29. Best practice for hashing passwords – SHA256 or SHA512?
  30. how to get hash code of a string in c++

Leave a Comment