Software performance of universal hash functions

Abstract

This paper compares the parameters sizes and software per- formance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison be- tween these widely varying approaches is achieved by deffining construc- tions that of eracomparable 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.