Hash function balance and its impact on birthday attacks

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

Volumn 3027, Issue , 2004, Pages 401-418

  Bellare, Mihir ^a   Kohno, Tadayoshi ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BIRTHDAY ATTACKS; DESIGN PRINCIPLES; HASH COMPUTATION; PRE IMAGES;

HASH FUNCTIONS;

EID: 30744457437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_24     Document Type: Article

References (10)

1. M. BELLARE AND T. KOHNO. Hash function balance and its impact on birthday attacks. IACR ePrint archive, http://eprint.iacr.org/2003/065/. Full version of this paper
2. I. DAMGÅRD. A design principle for hash functions. Advances in Cryptology CRYPTO '89, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
3. H. DOBBERTIN, A. BOSSELAERS AND B. PRENEEL. RIPEMD-160, a strengthened version of RIPEMD. Fast Software Encryption '96, Lecture Notes in Computer Science Vol. 1039, D. Gollmann ed., Springer-Verlag, 1996.
4. A. MENEZES, P. VAN OORSCHOT AND S. VANSTONE. Handbook of applied cryptography. CRC Press, 1997.
5. R. MERKLE. One way hash functions and DES. Advances in Cryptology - CRYPTO '89, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
6. National Institute of Standards. FIPS 180-2, Secure hash standard. August 1, 2000.
7. R. RIVEST. The MD5 message-digest algorithm. IETF RFC 1321, April 1992.
8. D. STINSON. Cryptography theory and practice, 1st Edition. CRC Press, 1995.
9. P. VAN OORSCHOT AND M. WIENER. Parallel collision search with cryptanalytic applications, Journal of Cryptology 12(1), Jan 1999, 1-28.
10. G. YUVAL. How to swindle Rabin. Cryptologia (3), 1979, 187-190.