Message authentication on 64-bit architectures

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

Volumn 4356 LNCS, Issue , 2007, Pages 327-341

  Krovetz, Ted ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Architectural optimization; Message authentication; Universal hashing

Indexed keywords

ALGORITHMS; MESSAGE PASSING; OPTIMIZATION; PROGRAM PROCESSORS;

ARCHITECTURAL OPTIMIZATION; MESSAGE AUTHENTICATION ALGORITHM (MAC); UNIVERSAL HASHING;

AUTHENTICATION;

EID: 38149087416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74462-7_23     Document Type: Conference Paper

References (14)

1. Afanassiev, V., Gehrmann, C., Smeets, B.: Fast message authentication using efficient polynomial evaluation. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 190-204. Springer, Heidelberg (1997)
2. Bernstein, D.: Stronger security bounds for Wegman-Carter-Shoup authenticators. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 164-180. Springer, Heidelberg (2005)
3. Bernstein, D.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 32-49. Springer, Heidelberg (2005)
4. Bierbrauer, J., Johansson, T., Kabatianskii, G., Smeets, B.: On families of hash functions via geometric codes and concatenation. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 331-342. Springer, Heidelberg (1994)
5. Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and secure message authentication. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 216-233. Springer, Heidelberg (1999)
6. Boesgaard, M., Christensen, T., Badger, Z.E.: A fast and provably secure MAC. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 176-191. Springer, Heidelberg (2005)
7. Carter, L., Wegman, M.: Universal classes of hash functions. J. of Computer and System Sciences 22, 265-279 (1981)
8. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithms, Section 11.3.3. MIT Press, Cambridge (2001)
9. Halevi, S., Krawczyk, H.: MMH: Software message authentication in the Gbit/second rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 172-189. Springer, Heidelberg (1997)
10. Knuth, D.: The Art of Computer Programming. In: Seminumerical Algorithms, 3rd edn., vol. 2, pp. 486-489. Addison-Wesley, Reading (1998)
11. Krovetz, T., Rogaway, P.: Fast universal hashing with small keys and no preprocessing: The PolyR construction. In: Information Security and Cryptology - ICICS 2000, pp. 73-89. Springer, Heidelberg (2000)
12. Shoup, V.: On fast and provably secure message authentication based on universal hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 313-328. Springer, Heidelberg (1996)
13. Stinson, D.: Universal hashing and authentication codes. Designs, Codes and Cryptography 4, 369-380 (1994)
14. Wegman, M., Carter, L.: New hash functions and their use in authentication and set equality. J. of Computer and System Sciences 18, 143-154 (1979)