New hash functions for message authentication

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

Volumn 921, Issue , 1995, Pages 301-310

  Krawczyk, Hugo ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; HASH FUNCTIONS; MATRIX ALGEBRA; SHIFT REGISTERS;

ALGEBRAIC CONSTRUCTIONS; AUTHENTICATION SCHEME; CONSECUTIVE INTEGERS; CRYPTOGRAPHIC APPLICATIONS; EFFICIENT CONSTRUCTION; LINEAR FEEDBACK SHIFT REGISTERS; MESSAGE AUTHENTICATION; MODULAR ARITHMETIC;

CRYPTOGRAPHY;

EID: 84957367286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49264-X_24     Document Type: Conference Paper

References (10)

1. Noga Alon, Oded Goldreich, Johan Hastad, and Rene Peralta. Simple constructions of almost k-wise independent random variables. In 31th Annual Symposium on Foundatiom of Computer Science, St. Louis, Missouri, pages 544-553, October 1990.
2. Bierbrauer J., Johansson T., Kabatianskii G., and Smeets, B., “On Families of Hash Functions via Geometric Codes and Concatenation”, Crypto’99
3. G. Even. Construction of small probability spaces for simulatiort. M.Sc. thesis, Dept. of Computer Science, Technion, August 1991.
4. Krawczyk, H., “LFSR-based Hashing and Authentication”, Advances in Cryptology - CRYPT0 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Springer- Verlag, Y. G. Desmedt, ed 1994, pp. 129-139.
5. E. Kushilevitz and Y. Mansour. “Learning decision trees using the Fourier spectrum”, SIAM Journal on Computing 22(6) 1331-1348, December 1993.
6. Mansour, Y., Nisan, N., and Tiwari, P., “The Computational Complexity of Universal Hash Functions”, Theoretical Computer Science, 107(1):121-133, 1993.
7. Joseph Naor and Moni Naor. Small bias probability spaces: efficient construction and applications. SIAM Jour. on Computing, Vol. 22, No. 4, 1993, pp. 838-856.
8. Stinson, D.R., “Universal hashing and authentication codes”, Proc. of Crypto’91, pp.74-85
9. Vazirani, U.V., “Randomness, Adversaries and Computation”, Ph.D. Thesis, EECS, UC Berkeley, 1986
10. Wegman, M.N., and Carter, J.L., “New Hash Functions and Their Use in Authentication and Set Equality”, JCSS, 22, 1981, pp. 265-279.