Performance of the most common non‐cryptographic hash functions. (28th January 2013)

• Record Type: Journal Article
• Authors: Estébanez, César; Saez, Yago; Recio, Gustavo; Isasi, Pedro
• Is Part Of: Software, practice & experience. Volume 44:Number 6(2014)
• Page Start: 681
• Page End: 698
• Publication Date: 2013-01-28
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2179
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2179-abs-0001"> <title>SUMMARY</title> <p>Non‐cryptographic hash functions (NCHFs) have an immense number of applications, ranging from compilers and databases to videogames and computer networks. Some of the most important NCHF have been used by major corporations in commercial products. This practical success demonstrates the ability of hashing systems to provide extremely efficient searches over unsorted sets. However, very little research has been devoted to the experimental evaluation of these functions. Therefore, we evaluated the most widely used NCHF using four criteria as follows: collision resistance, distribution of outputs, avalanche effect, and speed. We identified their strengths and weaknesses and found significant flaws in some cases. We also discuss our conclusions regarding general hashing considerations such as selection of the compression map. Our results should assist practitioners and engineers in making more informed choices regarding which function to use for a particular problem. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>