{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:03:28Z","timestamp":1750309408547,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Queue"],"published-print":{"date-parts":[[2024,8,30]]},"abstract":"<jats:p>Although cryptographic and non-cryptographic hash functions are everywhere, there seems to be a gap in how they are designed. Lots of criteria exist for cryptographic hashes motivated by various security requirements, but on the non-cryptographic side there is a certain amount of folklore that, despite the long history of hash functions, has not been fully explored. While targeting a uniform distribution makes a lot of sense for real-world datasets, it can be a challenge when confronted by a dataset with particular patterns.<\/jats:p>","DOI":"10.1145\/3690759","type":"journal-article","created":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T18:18:16Z","timestamp":1726597096000},"page":"54-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Questioning the Criteria for Evaluating Non-cryptographic Hash Functions"],"prefix":"10.1145","volume":"22","author":[{"given":"Catherine","family":"Hayes","sequence":"first","affiliation":[{"name":"Maynooth University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Malone","sequence":"additional","affiliation":[{"name":"Maynooth University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2020920014"},{"volume-title":"Progress in Cryptology (IndoCrypt), 489?508","author":"Aumasson J.-P.","key":"e_1_2_1_2_1","unstructured":"Aumasson, J.-P., Bernstein, D. J. 2012. SipHash: a fast short-input PRF. In Progress in Cryptology (IndoCrypt), 489?508. Springer; https:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-34931-7_28."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Bloom B. H. 1970. Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM 13 (7) 422?426; https:\/\/dl.acm.org\/doi\/10.1145\/362686.362692.","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSD53832.2021.00059"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_2_1_6_1","volume-title":"12th Usenix Security Symposium; https:\/\/www.usenix.org\/legacy\/events\/sec03\/tech\/full_papers\/crosby\/crosby.pdf.","author":"Crosby S. A.","year":"2003","unstructured":"Crosby, S. A., Wallach, D. S. 2003. Denial of service via algorithmic complexity attacks. 12th Usenix Security Symposium; https:\/\/www.usenix.org\/legacy\/events\/sec03\/tech\/full_papers\/crosby\/crosby.pdf."},{"issue":"6","key":"e_1_2_1_7_1","article-title":"Performance of the most common non-cryptographic hash functions","volume":"44","author":"Est\u00e9banez C.","year":"2014","unstructured":"Est\u00e9banez, C., Saez, Y., Recio, G., Isasi, P. 2014. Performance of the most common non-cryptographic hash functions. Journal of Software: Practice and Experience 44 (6), 681?698. John Wiley & Sons; https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.2179; https:\/\/e-archivo.uc3m.es\/rest\/api\/core\/bitstreams\/c2735ec2-8ae9-47f1-b663-dcda0c4f6204\/content.","journal-title":"Journal of Software: Practice and Experience"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12033"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Henke C. Schmoll C. Zseby T. Empirical evaluation of hash functions for multipoint measurements. ACM SIGCOMM Computer Communication Review 38 (3) 39?50; https:\/\/dl.acm.org\/doi\/10.1145\/1384609.1384614.","DOI":"10.1145\/1384609.1384614"},{"volume-title":"Introduction to Modern Cryptography","author":"Katz J.","key":"e_1_2_1_10_1","unstructured":"Katz, J., Lindell, Y. 2014. Substitution permutation networks (chapter 6.2.1). In Introduction to Modern Cryptography. CRC Press."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230636"},{"key":"e_1_2_1_12_1","volume-title":"The Pluto Scarab","author":"Mulvey B.","year":"2023","unstructured":"Mulvey, B. The Pluto Scarab; https:\/\/web.archive.org\/web\/20230603152138\/https:\/\/papa.bretmulvey.com\/post\/124027987928\/hash-functions."},{"volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"Schneier B.","key":"e_1_2_1_13_1","unstructured":"Schneier, B. 1996. Description of DES (chapter 12.2). In Applied Cryptography: Protocols, Algorithms, and Source Code in C, second edition. John Wiley and Sons, Inc."},{"key":"e_1_2_1_14_1","unstructured":"Noll L. C. Too many demands for a single cryptographic hash function to satisfy; http:\/\/www.isthe.com\/chongo\/tech\/comp\/crypto-hash.html."},{"key":"e_1_2_1_15_1","unstructured":"Uzgalis R. 1996. Hashing concepts and the Java programming language; http:\/\/www.serve.net\/buz\/hash.adt\/java.000.html."},{"key":"e_1_2_1_16_1","unstructured":"Valloud A. 2008. Hashing in Smalltalk: Theory and Practice. Self-published lulu.com."}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690759","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:06Z","timestamp":1750294686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690759"}},"subtitle":["Maybe we need to think more about non-cryptographic hash functions."],"short-title":[],"issued":{"date-parts":[[2024,8,30]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8,30]]}},"alternative-id":["10.1145\/3690759"],"URL":"https:\/\/doi.org\/10.1145\/3690759","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"type":"print","value":"1542-7730"},{"type":"electronic","value":"1542-7749"}],"subject":[],"published":{"date-parts":[[2024,8,30]]},"assertion":[{"value":"2024-09-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}