UMAC: Fast and secure message authentication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1666, Issue , 1999, Pages 216-233

  Black, J ^a   Halevi, S ^b   Krawczyk, H ^b,c   Krovetz, T ^a   Rogaway, P ^a  

^a University of California Davis   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

CRYPTOGRAPHIC HASH FUNCTIONS; CRYPTOGRAPHIC PRIMITIVES; CURRENT PRACTICES; FASTER IMPLEMENTATION; MESSAGE AUTHENTICATION; MESSAGE AUTHENTICATION ALGORITHMS; SECURE MESSAGES; UNIVERSAL HASH FUNCTION FAMILY;

AUTHENTICATION;

EID: 84957068240     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_14     Document Type: Conference Paper

References (28)

1. Afanassiev, V., Gehrmann, C., and Smeets, B. Fast message authentication using effcient polynomial evaluation. In Proceedings of the 4th Workshop on Fast Software Encryption. (1997), vol. 1267, Springer-Verlag, pp 190-204.
2. Ansi X9.9. American national standard - Financial institution message authentication (wholesale). ASC X9 Secretariat - American Bankers Association, 1986.
3. 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 15.
4. 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.
5. 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.
6. Bernstein, D. Guaranteed message authentication faster than MD5. Unpublished manuscript, 1999.
7. Black, J., Halevi, S., Hevia, A., Krawczyk, H., Krovetz, T., and Rogaway, P. UMAC - Message authentication code using universal hashing. Unpublished specification, www.cs.ucdavis.edu/~rogaway/umac, 1999.
8. 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 www.cs.ucdavis.edu/~rogaway/umac.
9. Brassard, G. On computationally secure authentication tags requiring short secret shared keys. In Advances in Cryptology - CRYPTO '82. (1983), Springer-Verlag, pp 79-86.
10. Carter, L., and Wegman, M. Universal hash functions. J. Of Computer and System Sciences, 18 (1979), 143-154.
11. FIPS 180-1. Secure hash standard. NIST, US Dept. Of Commerce, 1995.
12. H. Krawczyk, M. B., and Canetti, R. HMAC: Keyed hashing for message authentication. IETF RFC-2104, 1997.
13. 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.
14. Johansson, T. Bucket hashing with small key size. In Advances in Cryptology - EUROCRYPT '97. (1997), Lecture Notes in Computer Science, Springer-Verlag.
15. Kaliski, B., and Robshaw, M. Message authentication with MD5, 1995. Technical newsletter of RSA Laboratories.
16. 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.
17. Krovetz, T. UMAC reference code (in ANSI C with Pentium assembly). Available from www.cs.ucdavis.edu/~rogaway/umac, 1999.
18. 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.
19. 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.
20. 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.
21. Petrank, E., and Rackoff, C. CBC MAC for real-time data sources. Manuscript 97-10 in http://philby.ucsd.edu/cryptolib.html, 1997.
22. 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 4.
23. 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.
24. Rivest, R., Robshaw, M., Sidney, R., and Yin, Y. The RC6 block cipher. Available from http://theory.lcs.mit.edu/~rivest/publications.html, 1998.
25. 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.
26. 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.
27. Tsudik, G. Message authentication with one-way hash functions. In Proceedings of Infocom '92. (1992), IEEE Press.
28. 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.