Talk:Data Structures/Hash Tables

no topic
The article in Wikipedia is way better and more in depth than the information given here. It would be an easy improvement if they were merged together.


 * Someone has already done that but not by way of as transwiki, I added the needed attribution to the book. Please check out the text and see if all information is relevant. --Panic (talk) 05:56, 8 June 2010 (UTC)

cryptographic hash comment
The article states: "In fact, even a cryptographic hash does not provide protection against an adversary who wishes to degrade hash table performance by choosing keys all hashing to the same bucket." That depends on the cryptographic hash being used. A few years ago it was shown MD5 was broken when it came to strong collision resistance (it should be hard to find two different messages m1, and m2, such that hash(m1) = hash(m2)), but I don't believe that to be the case with SHA-1, the cryptographic hash used in the example.