------- Original message -------
From: Branko Čibej
A good, seeded cryptographic hash function would scatter the values much better than this does.
Just to make the hash more resistant to having the same content in upper bits (because we start from a common random seed), we could run the hash value produced by hashing the strings through the hash function twice. It may make a difference for larger hash tables. -- Bojan
