Good hashing algorithm for address list (memory)

Question

I have a list of (64-bit) addresses representing the stack frame, and I want to hash them with a single 64-bit number to help identify those that were seen before. There are no more than 128 addresses.

My current algorithm computes the hash by iterating over the list, xor'ing each address into a hash and rotating the hash 11 bits per clock cycle.

Any best deals?

Answer 1

You may consider some kind of CRC .

Perhaps CRC64 .

Answer 2

There are a couple of good whole hash functions for 32 and 64 bits: http://www.concentric.net/~Ttwang/tech/inthash.htm

It also says: http://burtleburtle.net/bob/hash/evahash.html

Answer 3

If performance is not an issue, you can try a cryptographic hash - truncate the number of bytes you want.