LFSR-based hashing and authentication

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

Volumn 839 LNCS, Issue , 1994, Pages 129-139

  Krawczyk, Hugo ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; HASH FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY;

CYCLIC REDUNDANCY CODES; FAILURE PROBABILITY; IMPLEMENTATION COMPLEXITY; LINEAR FEEDBACK SHIFT REGISTERS; MESSAGE AUTHENTICATION; RANDOM MATRIX; SECURE AUTHENTICATIONS; STREAM CIPHERS;

SHIFT REGISTERS;

EID: 84991939136     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_15     Document Type: Conference Paper

References (21)

1. Noga Alon, Oded Goldreich, Johan Hastad, and Rene Peralta. Simple constructions of almost k-wise independent random variables. In 31th Annual Symposium on Foundations 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”, Proc. of Crypto’93, pp. 331-342.
3. Birch, J., Christensen, L.G., and Skov, M., “A programmable 800 Mbit/s CRC check/generator unit for LANs and MANs”, Comp. Networks and ISDN Sys., 1992.
4. Brassard, G., “On computationally secure authentication tags requiring short secret shared keys”, Proc. of Crypto’82, pp.79-86.
5. Carter, J.L. and Wegman, M.N., “Universal Classes of Hash Functions”, JCSS, 18, 1979, pp. 143-154.
6. Desmedt, Y., “Unconditionally secure authentication schemes and practical and theoretical consequences”, Proc. of Crypto’ 85, pp.42-55.
7. Gemmell, P., and Naor, M., “Codes for Interactive Authentication”, Proc. of Crypto’ 93, pp. 355-367.
8. Gilbert, E.N., MacWilliams, F.J., and Sloane, N.J.A., “Codes which detect deception”, Bell Syst. Tech. J., Vol. 53, 1974, pp. 405-424.
9. John A Gordon, “Very simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field”, Electronics Letters, Vol. 12, 1976, pp. 663-664.
10. Johansson T., “A Shift Register Construction of Unconditionally Secure Authentication Codes”, Design, Codes and Cryptography, 4, 1994, pp. 69-81.
11. Johansson T., Kabatianskii G., and Smeets, B., “On the Relation Between A-Codes and Codes Correcting Independent Errors”, Proc. of Eurocrypt’ 93, pp. 1-11.
12. Lai, X., Rueppel, R.A., and Woollven, J., “A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers”, Auscrypt’ 92, pp. 339-348.
13. Lidl, R., and Niederreiter, H., “Finite Fields”, in Encyclopedia of Mathematics and Its Applications, Vol. 20, Reading, MA: Addison-Wesley, 1983.
14. Mansour, Y., Nisan, N., and Tiwari, P., “The Computational Complexity of Universal Hashing”, STOC’ 90, pp. 235-243.
15. Joseph Naor and Moni Naor. Small bias probability spaces: efficient construction and applications. In Proceedings of the 22 nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pages 213-223, May 1990.
16. Rabin, M.O., “Fingerprinting by Random Polynomials”, Tech. Rep. TR-15-81, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., 1981.
17. Simmons, G.J., “Authentication theory/coding theory”, Proc. of Crypto’ 84, 411-431.
18. Simmons, G.J., “A Survey of Information Authentication”, in Gustavos J. Simmons, editor, Contemporary Cryptology, The Science of Information, IEEE Press, 1992.
19. Stinson, D.R., “Universal hashing and authentication codes”, Proc. of Crypto’ 91, pp. 74-85.
20. Taylor, R., “An integrity check value algorithm for stream ciphers”, Proc. of Crypto’93, pp. 40-48.
21. Wegman, M.N., and Carter, J.L., “New Hash Functions and Their Use in Authentication and Set Equality”, JCSS, 22, 1981, pp. 265-279.