Abstract
We introduce a new technique for generating a message authentication code (MAC). At its center is a simple metaphor: to (non-cryptographically) 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.
Chapter PDF
References
R. Arnold and D. Coppersmith, “An alternative to perfect hashing.” IBM RC 10332 (1984).
M. Bellare, O. Goldreich and S. Goldwasser. “Incremental cryptography: The case of hashing and signing.” Advances in Cryptology — CRYPTO’ 94 Proceedings, Springer-Verlag (1994).
M. Bellare, J. Kilian and P. Rogaway, “The security of cipher block chaining.” Advances in Cryptology — CRYPTO’ 94 Proceedings, 341–358 (1994).
J. Bondy and U. Murty, Graph theory with Applications. North Holland (1976).
G. Brassard, “On computationally secure authentication tags requiring short secret shared keys.” Advances in Cryptology — CRYPTO’ 82 Proceedings, 79–86 (1983).
J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets, “On families of hash functions via geometric codes and concatenation.” Advances in Cryptology—CRYPTO’ 93 Proceedings, Springer-Verlag, 331–342 (1994).
L. Carter and M. Wegman, “Universal hash functions,” J. of Computer and System Sciences 18, 143–154 (1979).
Y. Desmedt, “Unconditionally secure authentication schemes and practical and theoretical consequences.” Advances in Cryptology — CRYPTO’ 85 Proceedings, Springer-Verlag, 42–45 (1985).
P. Gemmell and M. Naor, “Codes for interactive authentication.” Advances in Cryptology — CRYPTO’ 93 Proceedings, Springer-Verlag, 355–367 (1994).
O. Goldreich, S. Goldwasser and S. Micali, “How to construct random functions.” Journal of the ACM, Vol. 33, No. 4, 210–217 (1986).
S. Goldwasser, S. Micali and R. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM Journal of Computing, 17(2):281–308, April 1988.
H. Krawczyk, “LFSR-based hashing and authentication.” Advances in Cryptology — CRYPTO’ 94 Proceedings, Springer-Verlag, 129–139 (1994).
M. Luby and C. Rackoff, “How to construct pseudorandom permutations from pseudorandom functions,” SIAM J. Comput, Vol. 17, No. 2, April 1988.
X. Lai, R. Rueppel and J. Woollven, “A fast cryptographic checksum algorithm based on stream ciphers.” Advances in Cryptology, Proceedings of AUSCRYPT 92. Springer-Verlag (1992).
P. Pearson, “Fast hashing of variable-length text strings.” Communications of the ACM, 33(6), 677–680 (1990).
R. Rivest, “The MD5 message digest algorithm.” IETF RFC-1321 (1992).
P. Rogaway, “Bucket hashing and its application to fast message authentication.” (Full version of this paper.) Available from the author or out of http://www.cs.ucdavis.edu/~rogaway/
G. Simmons, “A survey of information authentication.” In Contemporary Cryptography, The Science of Information Integrity, G. Simmons, editor. IEEE Press, New York (1992).
D. Stinson, “Universal hashing and authentication codes.” Designs, Codes and Cryptography, vol. 4, 369–380 (1994). Earlier version in Advances in Cryptology — CRYPTO’ 91 Proceedings, Springer-Verlag, 74–85 (1991).
R. Taylor, “An integrity check value algorithm for stream ciphers.” Advances in Cryptology — CRYPTO’ 93 Proceedings, Springer-Verlag, 40–48 (1994).
J. Touch, “Performance analysis of MD 5.” Manuscript, February 1995.
G. Tsudik, “Message authentication with one-way hash functions.” Proceedings of Infocom 92, IEEE Press (1992)
M. Wegman and L. Carter, “New hash functions and their use in authentication and set equality.” J. of Computer and System Sciences 22, 265–279 (1981).
D. Wheeler, “A bulk data encryption algorithm.” Fast Software Encryption, Cambridge Security Workshop, 1993 Proceedings, R. Anderson, ed., 127–134. Lecture Notes in Computer Science, vol. 809, Springer-Verlag (1994).
A. Zobrist, “A new hashing method with applications for game playing.” University of Wisconsin, Dept. of Computer Science, TR #88 (April 1970).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rogaway, P. (1995). Bucket Hashing and its Application to Fast Message Authentication. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive