Fast message authentication using efficient polynomial evaluation

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

Volumn 1267, Issue , 1997, Pages 190-204

  Afanassiev, Valentine ^a   Gehrmann, Christian ^b   Smeets, Ben ^b  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Message authentication; Polynomial evaluation; Software MAC generation; Universal hash functions

Indexed keywords

AUTHENTICATION; HASH FUNCTIONS;

MESSAGE AUTHENTICATION; MESSAGE AUTHENTICATION CODES; POLYNOMIAL EVALUATION; SOFTWARE COMPLEXITY; UNIVERSAL HASH FUNCTION;

POLYNOMIALS;

EID: 21744457386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0052346     Document Type: Conference Paper

References (21)

1. G.J. Simmons, "A survey of information authentication," in Contemporary Cryptology, The Science of Information Integrity, ed. G.J. Simmons, IEEE Press, New York, 1992.
2. P. Rogaway, "Bucket hashing and its application to fast message authentication," Proceedings of CRYPTO '95, Springer Verlag, pp. 29-42, August, 1995.
3. M. Bellare, J. Kilian, and P. Rogaway, "The security of cipher block chaining," Proceedings of CRYPTO' 94, Springer Verlag, pp. 341-358, August, 1994.
4. M. Wegman and L. Carter, "New hash functions and their use in authentication and set equality," J. of Computer and System Sciences 22, pp. 265-279, 1981.
5. D. Stinson, "Universal hashing and authentication codes," Designs, Codes and Cryptography, Vol. 4, pp. 369-380, 1994.
6. J. Bierbrauer, T. Johansson, G. Kabatanskii and B. Smeets, "On families of hash functions via geometric codes and concatenation," Proceedings of CRYPTO '93, Springer Verlag, pp. 331-342, 1994.
7. P. Gemmell and M. Naor, "Codes for interactive authentication," Proceedings of CRYPTO '93, Springer Verlag, pp. 355-367, 1994.
8. C. Gehrmann, "Cryptanalysis of the Gemmell and Naor multiround authentication protocol," Proceedings of CRYPTO '94, Springer Verlag, pp. 121-128, 1994.
9. C. Gehrmann, "Secure multiround authentication protocols," Proceedings of Euro- crypt '95, Springer Verlag, pp. 158-167, 1995.
10. T. Johansson, Contribution to Unconditionally Secure Authentication, Ph. D. thesis, Lund 1994.
11. M. Atici and D. R. Stinson, "Universal hashing and multiple authentication," Proceedings of CRYPTO '96, Springer Verlag, pp. 16-30, 1996.
12. J.E. Savage, "The complexity of decoders. Computational work and decoding time," IEEE. Trans. Inform. Theory, Vol. 17, pp. 77-85, January, 1971.
13. E.R. Berlekamp, "Bit-serial Reed-Solomon encoder," IEEE. Trans. Inform. Theory, Vol. 28, pp. 869-874, November, 1982.
14. m)," IEE Proceedings-E, Vol.139, No. 3, May, 1992.
15. D. Jungnickel, Finite fields: structure and arithmetics, Wissenschaftsverlag, Mannheim-Leipzig-Wien-Zurich, 1993.
16. V.B. Afanassiev, "On the complexity of finite field arithmetic," Fifth Soviet-Swedish Int. Workshop on Inform. Theory, Moscow, January, 1991.
17. m), Internal Report LiTH-ISY-I, Linköping Univ., Sweden, 1988.
18. T. Kasami, "An upper bound on k/n for affine-invariant codes with fixed d/n," IEEE Trans. Inform. Theory, Vol. 15, pp. 174-176, January, 1969.
19. P. Piret, "On the number of divisors of a polynomial over GF(2)," Springer Verlag, Lecture Notes in Comp. Sei. 228, pp. 161-168, 1985.
20. I. E. Shparlinski, Computational and algorithmic problems in finite fields, Kluwer, Dordtrecht-Boston-London, 1992.
21. H. Riesel, Prime Numbers and Computer Methods for Factorization, Birkhuser, Boston-Basel-Stuttgart, 1985.