Abstract
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current practice (e.g., HMAC-SHA1), and about twice as fast as times previously reported for the universal hash-function family MMH. To achieve such speeds, UMAC uses a new universal hash-function family, NH, and a design which allows effective exploitation of SIMD parallelism. The “cryptographic” work of UMAC is done using standard primitives of the user’s choice, such as a block cipher or cryptographic hash function; no new heuristic primitives are developed here. Instead, the security of UMAC is rigorously proven, in the sense of giving exact and quantitatively strong results which demonstrate an inability to forge UMAC-authenticated messages assuming an inability to break the underlying cryptographic primitive. Unlike conventional, inherently serial MACs, UMAC is parallelizable, and will have ever-faster implementation speeds as machines offer up increasing amounts of parallelism. We envision UMAC as a practical algorithm for next-generation message authentication.
Chapter PDF
References
Afanassiev, V., Gehrmann, C., and Smeets, B. Fast message authentication using efficient polynomial evaluation. In Proceedings of the 4th Workshop on Fast Software Encryption (1997), vol. 1267, Springer-Verlag, pp. 190–204.
Ansi X9.9. American national standard — Financial institution message authentication (wholesale). ASC X9 Secretariat-American Bankers Association, 1986.
Bellare, M., Canetti, R., and Krawczyk, H. Keying hash functions for message authentication. In Advances in Cryptology-CRYPTO’ 96 (1996), vol. 1109 of Lecture Notes in Computer Science, Springer-Verlag, pp. 1–15.
Bellare, M., Canetti, R., and Krawczyk, H. Pseudorandom functions revisited: The cascade construction. In 37th Annual Symposium on Foundations of Computer Science (1996), IEEE Computer Society, pp. 514–523.
Bellare, M., Kilian, J., and Rogaway, P. The security of cipher block chaining. In Advances in Cryptology-CRYPTO’ 94 (1994), vol. 839 of Lecture Notes in Computer Science, Springer-Verlag, pp. 341–358.
Bernstein, D. Guaranteed message authentication faster than MD5. Unpublished manuscript, 1999.
Black, J., Halevi, S., Hevia, A., Krawczyk, H., Krovetz, T., and Rogaway, P. UMAC — Message authentication code using universal hashing. Unpublished specification, http://www.cs.ucdavis.edu/~rogaway/umac, 1999.
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., and Rogaway, P. UMAC: Fast and secure message authentication. In Advances in Cryptology-CRYPTO’ 99 (1999), Lecture Notes in Computer Science, Springer-Verlag. Full version of this paper, available at http://www.cs.ucdavis.edu/~rogaway/umac.
Brassard, G. On computationally secure authentication tags requiring short secret shared keys. In Advances in Cryptology-CRYPTO’ 82 (1983), Springer-Verlag, pp. 79–86.
Carter, L., and Wegman, M. Universal hash functions. J. of Computer and System Sciences, 18 (1979), 143–154.
FIPS 180-1. Secure hash standard. NIST, US Dept. of Commerce, 1995.
H. Krawczyk, M. B., and Canetti, R. HMAC: Keyed hashing for message authentication. IETF RFC-2104, 1997.
Halevi, S., and Krawczyk, H. MMH: Software message authentication in the Gbit/second rates. In Proceedings of the 4th Workshop on Fast Software Encryption (1997), vol. 1267, Springer-Verlag, pp. 172–189.
Johansson, T. Bucket hashing with small key size. In Advances in Cryptology-EUROCRYPT’ 97 (1997), Lecture Notes in Computer Science, Springer-Verlag.
Kaliski, B., and Robshaw, M. Message authentication with MD5, 1995. Technical newsletter of RSA Laboratories.
Krawczyk, H. LFSR-based hashing and authentication. In Advances in Cryptology-CRYPTO’ 94 (1994), vol. 839 of Lecture Notes in Computer Science, Springer-Verlag, pp. 129–139.
Krovetz, T. UMAC reference code (in ANSI C with Pentium assembly). Available from http://www.cs.ucdavis.edu/~rogaway/umac, 1999.
Mansour, Y., Nissan, N., and Tiwari, P. The computational complexity of universal hashing. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing (1990), ACM Press, pp. 235–243.
Nevelsteen, W., and Preneel, B. Software performance of universal hash functions. In Advances in Cryptology — EUROCRYPT’ 99 (1999), vol. 1592 of Lecture Notes in Computer Science, Springer-Verlag, pp. 24–41.
Patel, S., and Ramzan, Z. Square hash: Fast message authentication via optimized universal hash functions. In Advances in Cryptology — CRYPTO’ 99 (1999), Lecture Notes in Computer Science, Springer-Verlag.
Petrank, E., and Rackoff, C. CBC MAC for real-time data sources. Manuscript 97-10 in http://philby.ucsd.edu/cryptolib.html, 1997.
Preneel, B., and van Oorschot, P. MDx-MAC and building fast MACs from hash functions. In Advances in Cryptology — CRYPTO’ 95 (1995), vol. 963 of Lecture Notes in Computer Science, Springer-Verlag, pp. 1–14.
Preneel, B., and van Oorschot, P. On the security of two MAC algorithms. In Advances in Cryptology — EUROCRYPT’ 96 (1996), vol. 1070 of Lecture Notes in Computer Science, Springer-Verlag, pp. 19–32.
Rivest, R., Robshaw, M., Sidney, R., and Yin, Y. The RC6 block cipher. Available from http://theory.lcs.mit.edu/~rivest/publications.html, 1998.
Rogaway, P. Bucket hashing and its application to fast message authentication. In Advances in Cryptology-CRYPTO’ 95 (1995), vol. 963 of Lecture Notes in Computer Science, Springer-Verlag, pp. 313–328.
Shoup, V. On fast and provably secure message authentication based on universal hashing. In Advances in Cryptology-CRYPTO’ 96 (1996), vol. 1109 of Lecture Notes in Computer Science, Springer-Verlag, pp. 74–85.
Tsudik, G. Message authentication with one-way hash functions. In Proceedings of Infocom’ 92 (1992), IEEE Press.
Wegman, M., and Carter, L. New hash functions and their use in authentication and set equality. In J. of Comp. and System Sciences (1981), vol. 22, pp. 265–279.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P. (1999). UMAC: Fast and Secure Message Authentication. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive