Some attacks against a double length hash proposal

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

Volumn 3788 LNCS, Issue , 2005, Pages 462-473

  Knudsen, Lars R ^a   Muller, Frédéric ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b DCSSI Crypto Lab   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION ATTACKS; DOUBLE LENGTH HASH PROPOSAL; N-BIT COMPRESSION FUNCTIONS; SECURITY BOUND;

BOUNDARY CONDITIONS; DATA COMPRESSION; DATA PRIVACY; FUNCTIONS; SECURITY OF DATA;

COMPUTER CRIME;

EID: 33646815676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_25     Document Type: Conference Paper

References (20)

1. E. Biham and R. Chen. Near-Collisions of SHA-0. In M. Franklin, editor, Advances in Cryptology - CRYPTO'04, volume 3152 of Lectures Notes in Computer Science, pages 290-305. Springer, 2004.
2. E. Biham, R. Chen, A. Joux, P. Carribault, C. Lemuet, and W. Jalby. Collisions of SHA-0 and Reduced SHA-1. In R. Cramer, editor, Advances in Cryptology - Eurocrypt'05, volume 3494 of Lectures Notes in Computer Science, pages 36-57. Springer, 2005.
3. J. Black, M. Cochran, and T. Shrimpton. On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions. In R. Cramer, editor, Advances in Cryptology - Eurocrypt'05, volume 3494 of Lectures Notes in Computer Science, pages 526-541. Springer, 2005.
4. F. Chabaud and A. Joux. Differential Collisions in SHA-0. In H. Krawczyk, editor, Advances in Cryptology - CRYPTO'98, volume 1462 of Lectures Notes in Computer Science, pages 56-71. Springer, 1998.
5. J-S. Coron, Y. Dodis, C. Malinaud, and P. Puniya. Merkle-Damgård Revisited: How to Construct a Hash Function. In V. Shoup, editor, Advances in Cryptology - Crypto'05, volume 3621 of Lectures Notes in Computer Science, pages 430-448. Springer, 2005.
6. I. Damgård, A Design Principle for Hash Functions. In G. Brassard, editor, Advances in Cryptology - Crypto '89, volume 435 of Lectures Notes in Computer Science, pages 416-427. Springer, 1990.
7. H. Dobbertin. Cryptanalysis of MD4. In D. Gollmann, editor, Fast Software Encryption - 1996, volume 1039 of Lectures Notes in Computer Science, pages 53-69. Springer, 1996.
8. S. Hirose. Provably Secure Double-Block-Length Hash Functions in a Black-Box Model. In C. Park and S. Chee, editors, Information Security and Cryptology - ICISC'04, volume 3506 of Lectures Notes in Computer Science, Springer, 2005.
9. A. Joux. Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. In M. Franklin, editor, Advances in Cryptology - CRYPTO'04, volume 3152 of Lectures Notes in Computer Science, pages 306-316. Springer, 2004.
10. n Work. In R. Cramer, editor, Advances in Cryptology - Eurocrypt'05, volume 3494 of Lectures Notes in Computer Science, pages 474-490. Springer, 2005.
11. S. Lucks. Design Principles for Iterated Hash Functions. Cryptology ePrint Archive, Report 2004/253, 2004. http://eprint.iacr.org/.
12. R. Merkle. One Way Hash Functions and DES. In G. Brassard, editor, Advances in Cryptology - Crypto '89, volume 435 of Lectures Notes in Computer Science, pages 428-446. Springer, 1990.
13. M. Nandi. Designs of Efficient Secure Large Hash Values. Cryptology ePrint Archive, Report 2004/296, 2004. http://eprint.iacr.org/.
14. M. Nandi, W. Lee, K. Sakurai, and S. Lee. Security analysis of a 2/3-rate double length compression function in black-box model. In H. Gilbert and H. Handschuh, editors, Fast Software Encryption - FSE'05, volume 3557 of Lectures Notes in Computer Science, pages 243-254. Springer, 2005.
15. National Institute of Standards and Technology (NIST). Secure Hash Standard FTPS Publication 180-2, August 2002. Available at http://csrc.nist.gov/ publications/fips/fips180-2/fips180-2.pdf.
16. D. Wagner. A Generalized Birthday Problem. In M. Yung, editor, Advances in Cryptology - Crypto '02, volume 2442 of Lectures Notes in Computer Science, pages 288-303. Springer, 2002. Extended Abstract.
17. X. Wang, X. Lai, D. Feng, H. Chen, and X. Yu. Cryptanalysis of the Hash Functions MD4 and RIPEMD. In R. Cramer, editor, Advances in Cryptology - Eurocrypt'05, volume 3494 of Lectures Notes in Computer Science, pages 1-18. Springer, 2005.
18. X. Wang, Y. Yin, and H. Yu. Finding Collisions in the Full SHA1. In V. Shoup, editor, Advances in Cryptology - Crypto'05, volume 3621 of Lectures Notes in Computer Science, pages 17-36. Springer, 2005.
19. X. Wang and H. Yu, How to Break MD5 and Other Hash Functions. In R. Cramer, editor, Advances in Cryptology - Eurocrypt'05, volume 3494 of Lectures Notes in Computer Science, pages 19-35. Springer, 2005.
20. X. Wang, H. Yu, and Y. Yin. Efficient Collision Search Attacks on SHAO. In V. Shoup, editor, Advances in Cryptology - Crypto'05, volume 3621 of Lectures Notes in Computer Science, pages 1-16. Springer, 2005.