Software performance of universal hash functions

  • Authors:
  • Wim Nevelsteen;Bart Preneel

  • Affiliations:
  • Katholieke Universiteit Leuven, Dept. Electrical Engineering, ESAT, Heverlee, Belgium;Katholieke Universiteit Leuven, Dept. Electrical Engineering, ESAT, Heverlee, Belgium

  • Venue:
  • EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a comparable security level. It is also demonstrated how the security of these constructions compares favorably to existing MAC algorithms, the security of which is less understood.