Bucket Hashing and its Application to Fast Message Authentication

We introduce a new technique for generating a message authentication code (MAC). At its center is a simple metaphor: to (noncryptographically) 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 the fastest known approach to software message authentication.

[1]  Mihir Bellare,et al.  Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.

[2]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[3]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[4]  Mihir Bellare,et al.  The Security of Cipher Block Chaining , 1994, CRYPTO.

[5]  Peter K. Pearson,et al.  Fast hashing of variable-length text strings , 1990, CACM.

[6]  Moni Naor,et al.  Codes for Interactive Authentication , 1994, CRYPTO.

[7]  Alan Siegel,et al.  On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  Hugo Krawczyk,et al.  LFSR-based Hashing and Authentication , 1994, CRYPTO.

[10]  Thomas Johansson,et al.  Bucket Hashing with a Small Key Size , 1997, EUROCRYPT.

[11]  Douglas R. Stinson,et al.  Universal hashing and authentication codes , 1991, Des. Codes Cryptogr..

[12]  Gene Tsudik,et al.  Message authentication with one-way hash functions , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[13]  Joos Vandewalle,et al.  Fast Hashing on the Pentium , 1996, CRYPTO.

[14]  Richard Taylor,et al.  An Integrity Check Value Algorithm for Stream Ciphers , 1993, CRYPTO.

[15]  Xuejia Lai,et al.  A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers , 1992, AUSCRYPT.

[16]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[17]  Ronald L. Rivest,et al.  The MD5 Message-Digest Algorithm , 1992, RFC.

[18]  Hugo Krawczyk,et al.  Keying Hash Functions for Message Authentication , 1996, CRYPTO.

[19]  Michael Luby,et al.  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.

[20]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[21]  Joseph D. Touch,et al.  Performance analysis of MD5 , 1995, SIGCOMM '95.

[22]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[23]  Thomas Johansson,et al.  On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.

[24]  Gustavus J. Simmons,et al.  A survey of information authentication , 1988, Proc. IEEE.

[25]  Albert L. Zobrist,et al.  A New Hashing Method with Application for Game Playing , 1990 .

[26]  David J. Wheeler.  A Bulk Data Encription Algorithm , 1993, FSE.

[27]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[28]  Thomas Johansson,et al.  On the Relation between A-Codes and Codes Correcting Independent Errors , 1994, EUROCRYPT.

[29]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[30]  Gilles Brassard,et al.  On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys , 1982, CRYPTO.

[31]  Umesh V. Vazirani,et al.  Efficiency considerations in using semi-random sources , 1987, STOC.

[32]  Yvo Desmedt,et al.  Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences , 1985, CRYPTO.

[33]  Victor Shoup,et al.  On Fast and Provably Secure Message Authentication Based on Universal Hashing , 1996, CRYPTO.