Collisions of SHA-0 and reduced SHA-1

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 36-57

  Biham, Eli ^a   Chen, Rafi ^a   Joux, Antoine ^b,c   Carribault, Patrick ^c   Lemuet, Christophe ^c   Jalby, William ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b DGA ^*

^c UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SIMULATION; MULTI AGENT SYSTEMS;

CRYPTANALYSIS; MULTI-BLOCK TECHNIQUES; NEAR-COLLISIONS;

CRYPTOGRAPHY;

EID: 24944584156     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_3     Document Type: Conference Paper

References (9)

1. Eli Biham, Rafi Chen, Near-Collisions of SHA-0, Advances in Cryptology, proceedings of CRYPTO 2004, LNCS 3152, pp. 290-305, Springer Verlag, 2004.
2. Florent Chabaud, Antoine Joux, Differential Collisions in SHA-0, Advanced in Cryptology, proceedings of CRYPTO '98, LNCS 1462, pp. 56-71, Springer Verlag, 1999.
3. National Institute of Standards and Technologies, Secure Hash Standard, Federal Information Processing Standards Publication, FIPS-180, May 1993.
4. National Institute of Standards and Technologies, Secure Hash Standard, Federal Information Processing Standards, Publication FIPS-180-1, April 1995.
5. Ron Rivest,The MD4 Message-Digest Algorithm, Network Working Group, Request for Comments: 1186, October 1990.
6. Ron Rivest, The MD5 Message-Digest Algorithm, Network Working Group, Request for Comments:1321, April 1992.
7. Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, and Xiuyuan Yu, Cryptanalysis for Hash Functions MD4 and RIPEMD, these proceedings.
8. Xiaoyun Wang, Hongbo Yu, How to Break MD5 and Other Hash Functions, these proceedings.
9. V. Rijmen, E. Oswald. Update on SHA-1. In RSA Crypto Track 2005, LNCS 3376, 2005.