Peter Kankowski has put together a very interesting comparison of hash functions. His main question, tests of the various types of hash function algorithms (e.g., multiplicative and complex), and his conclusion are useful and worth reviewing, if you're looking for an appropriate hash function for your application. As is frequently the case in many areas in design and computing, there are trade-offs (!).
Comments are closed.
|
AuthorArchives
June 2013
Categories
All
|