Questioning the Criteria for Evaluating Non-Cryptographic Hash Functions.

This article examines the criteria used to evaluate non-cryptographic hash functions, which prioritize speed and efficiency over security. While these functions aim to uniformly distribute inputs across resources, challenges such as input patterns, modulo bias, and limitations in uniformity remain....

Full description

Bibliographic Details
Published in:Communications of the ACM Vol. 68; no. 2; pp. 46 - 52
Main Authors: Hayes, Catherine, Malone, David
Format: Article
Published: Association for Computing Machinery Feb2025
Subjects:
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=182365566&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 182365566
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Feb2025
      vid: 68
      iid: 2
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        182365566
        10.1145/3704255
      ppf: 46
      ppct: 6
      formats:
      tig:
        atl: Questioning the Criteria for Evaluating Non-Cryptographic Hash Functions.
      aug:
        au:
          Hayes, Catherine
          Malone, David
        affil: Maynooth University, Maynooth, Co. Kildare, Ireland
      su:
        Computer network security
        Cryptography
        Hashing
        Algorithms
        Data structures
      sug:
        subj:
          Computer network security
          Cryptography
          Hashing
          Algorithms
          Data structures
      ab: This article examines the criteria used to evaluate non-cryptographic hash functions, which prioritize speed and efficiency over security. While these functions aim to uniformly distribute inputs across resources, challenges such as input patterns, modulo bias, and limitations in uniformity remain. Traditional measures like the avalanche criterion may not fully address real-world needs, as they focus more on randomizing input-output relationships than practical distribution in hash tables. The discussion highlights the need for tailored approaches to hash function design, balancing efficiency with application-specific requirements, and questions the feasibility of a one-size-fits-all solution.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2025
    holdings:
      @attributes:
        islocal: N