On the round security of symmetric-key cryptographic primitives

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

Volumn 1880, Issue , 2000, Pages 376-393

  Ramzan, Zulfikar ^a   Reyzin, Leonid ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLACK BOXES; BLOCK CIPHERS; CRYPTOGRAPHIC PRIMITIVES; MESSAGE AUTHENTICATION CODES; ROUND FUNCTIONS; SYMMETRIC KEYS; UNIVERSAL HASH FUNCTION;

HASH FUNCTIONS;

EID: 84974573774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_24     Document Type: Conference Paper

References (22)

1. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology-CRYPTO’96. Springer-Verlag.
2. Mihir Bellare, Ran Canetti, and Hugo Krawczyk. Pseudorandom functions revisited: The cascade construction and its concrete security. In 37th Annual Symposium on Foundations of Computer Science, pages 514-523. IEEE, 1996.
3. Mihir Bellare, Joe Kilian, and Phillip Rogaway. The security of cipher block chaining. In Yvo G. Desmedt, editor, Advances in Cryptology-CRYPTO’94, volume 839of Lecture Notes in Computer Science, pages 341-358. Springer-Verlag, 21-25 August 1994.
4. Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62-73, Fairfax, 1993.
5. E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer Verlag, 1993. ISBN: 0-387-97930-1, 3-540-97930.
6. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. UMAC: fast and secure message authentication. In M. Wiener, editor, Proc. CRYPTO99, volume 1666 of Springer-Verlag, pages 216-233, August 1999. Full version can be found at: http://www.cs.ucdavis.edu/˜rogaway/umac.
7. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proc. 30th ACM Symp. on Theory of Computing, 1998.
8. J. L. Carter and M. N. Wegman. Universal classes of hash functions. JCSS, 18(2):143-154, April 1979.
9. M. Etzel, S. Patel, and Z. Ramzan. Square hash: Fast message authentication via optimized universal hash functions. In Proc. CRYPTO99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
10. Shimon Even and Yishay Mansour. A construction of a cipher from a single pseudorandom permutation. Journal of Cryptology, 10(3):151-162, Summer 1997.
11. H. Feistel. Cryptography and computer privacy. Scientific American, 228(5):15-23, May 1973.
12. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, October 1984.
13. H. Krawczyk. LFSR-based hashing and authentication. In Proc. CRYPTO94, Lecture Notes in Computer Science. Springer-Verlag, 1994.
14. M. Luby and C. Rackoff. How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Computing, 17(2):373-386, April 1988.
15. M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. of Cryptology, 12:29-66, 1999. Preliminary version in: Proc. STOC 97.
16. National Bureau of Standards. FIPS publication 46: Data encryption standard, 1977. Federal Information Processing Standards Publication 46.
17. National Institute of Standards and Technology. Advanced encryption standard home page. http://www.nist.gov/aes.
18. S. Patel, Z. Ramzan, and G. Sundaram. Towards making Luby-Rackoff ciphers optimal and practical. In Proc. Fast Software Encryption 99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
19. R. Rivest. The MD5 message digest algorithm. IETF RFC-1321, 1992.
20. P. Rogaway. Bucket hashing and its application to fast message authentication. In Proc. CRYPTO95, Lecture Notes in Computer Science. Springer-Verlag, 1995.
21. B. Schneier. A self-study course in block cipher cryptanalysis. Available from: http://www.counterpane.com/self-study.html, 1998.
22. Mark N. Wegman and J. Lawrence Carter. New hash functions and their use in authentication and set equality. JCSS, 22(3):265-279, June 1981.