Abstract.
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x , cast each of its words into a small number of buckets; xor the contents of each bucket; then collect up all the buckets' contents. Used in the context of Wegman—Carter authentication, this style of hash function provides a fast approach for software message authentication.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received 13 May 1996 and revised 13 October 1997
Rights and permissions
About this article
Cite this article
Rogaway, P. Bucket Hashing and Its Application to Fast Message Authentication . J. Cryptology 12, 91–115 (1999). https://doi.org/10.1007/PL00003822
Published:
Issue Date:
DOI: https://doi.org/10.1007/PL00003822