On fast and provably secure message authentication based on universal hashing

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

Volumn 1109, Issue , 1996, Pages 313-328

  Shoup, Victor ^a  

^a Bellrore   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

EMPIRICAL PERFORMANCE; MESSAGE AUTHENTICATION; PROVABLY SECURE; TWO WAYS; UNIVERSAL HASH FUNCTION; UNIVERSAL HASHING;

AUTHENTICATION;

EID: 84942520895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_24     Document Type: Conference Paper

References (19)

1. W. Aiello and R. Venkatesan. Foiling birthday attacks in output-doubling transformations. In Advances in Cryptology-Eurocrypt '96, 1996. To appear.
2. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology-Crypto '96, 1996.
3. M. Bellare, R. Guérin, and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. In Advances in Cryptology- Crypto '95, pages 15-28, 1995.
4. M. Bellare, J. Kilian, and P. Rogaway. On the security of cipher block chaining. In Advances in Cryptology Crypto '94, pages 341-358, 1994.
5. A. Bosselaers, R. Govaerts, and J. Vandewalle. Fast hashing on the Pentium. In Advances in Cryptology-Crypto '96, 1996.
6. G. Brassard. On computationally secure authentication tags requiring short secret shared keys. In Advances in Cryptology-Crypto '82, pages 79-86, 1982.
7. E. Gilbert, F. M. Williams, and N. Sloane. Codes which detect deception. Bell System Technical Journal, 53(3):405-424, 1974.
8. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17:281-308, 1988.
9. J. Gordon. Very simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field. FAectronic Letters, 12:663-664, 1976.
10. D. How. Fast and portable DES encryption and decryption, 1992. Available from howβisl.Stanford.edu.
11. E. Kaltofen and B. Saunders. On Wiedeman's method of solving sparse linear systems. In Symp. Applied Algebra, Algebraic Algorithms, Error-Correcting Codes (Lecture Notes in Computer Science no. 539), pages 29-38, 1991.
12. H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology-Crypto '94, pages 129-139, 1994.
13. A. K. Lenstra and M. S. Manasse. Compact incremental Gaussian elimination over Z/2Z. Technical Report 88-16, University of Chicago Dept, of Computer Science, 1988.
14. J. Massey. Shift-register synthesis and BCH coding. IEEE Trans. Inf. Theory, IT-15:122-127, 1969.
15. D. Parkinson and M. Wunderlich. A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers. Parallel Computing, pages 65-73, 1984.
16. B. Preneel and P. van Oorschot. MDx-MAC and building fast MACs from hash functions. In Advances in Cryptology Crypto '95, pages 1-14, 1995.
17. P. Rogaway. Bucket hashing and its application to fast message authentication. In Advances in Cryptology- Crypto '95, pages 29-42, 1995.
18. M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, 22:265 -279, 1981.
19. D. Wiedemann. Solving sparse linear systems over finite fields. IEEE Trans. Inf. Theory, IT-32:54- 62, 1986.