Constructing secure hash functions by enhancing merkle-damgård construction

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

Volumn 4058 LNCS, Issue , 2006, Pages 407-420

  Gauravaram, Praveen ^a   Millan, William ^a   Dawson, Ed ^a   Viswanathan, Kapali ^b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b ABB CORPORATE RESEARCH   (India)

Author keywords

3C; 3C+; MBCA; Merkle Damg rd construction

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CRIME; COMPUTER SCIENCE; CRYPTOGRAPHY; SECURITY OF DATA; SECURITY SYSTEMS;

3C; 3C+; MD HASH FUNCTION; MERKLE-DAMGÅRD CONSTRUCTION; MULTI-BLOCK COLLISION ATTACKS (MBCA);

FUNCTION EVALUATION;

EID: 33746354987     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780656_34     Document Type: Conference Paper

References (19)

1. Eli Biham, Rafi Chen, Antoine Joux, Patrick Carribault, Christophe Lemuet, and William Jalby. Collisions of SHA-0 and Reduced SHA-1. In Ronald Cramer, editor, Advances in Cryptology - EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 36-57. Springer, 2005.
2. Ivan Damgard. A design principle for hash functions. In Gilles Brassard, editor, Advances in Cryptology: CRYPTO 89, volume 435 of Lecture Notes in Computer Science, pages 416-427. Springer-Verlag, 1989.
3. Richard Drews Dean. Formal Aspects of Mobile Code Security. PhD thesis, Princeton University, 1999.
4. Bert denBoer and Antoon Bosselaers. Collisions for the compression function of MD5. In T. Helleseth, editor, Advances in Cryptology -Eurocrypt '93, volume 765 of Lecture Notes in Computer' Science, pages 293-304, Berlin, 1994. Springer-Verlag.
5. Hans Dobbertin. Cryptanalysis of MD5 compress. Presented at the rump session of Euro Crypto'96 Rump Session, 1996.
6. Niels Ferguson and Bruce Schneier. Practical Cryptography, chapter Hash Functions, pages 83-96. John Wiley & Sons, 2003.
7. Praveen Gauravaram, William Millan, and Lauren May. CRUSH: A New Cryptographic Hash Function using Iterated Halving Technique. In Proceedings of the workshop on Cryptographic Algorithms and their uses, pages 28-39, Goldcoast, Australia, July 4-5 2004.
8. Antoine Joux. Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. In Matt Franklin, editor, Advances in Cryptology-CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 306-316, Santa Barbara, California, USA, August 15-19 2004. Springer.
9. John Kelsey and Bruce Schneier. Second Preimages on n-bit Hash Functions for Much Less than 2n̂ Work. In Ronald Cramer, editor, Advances in Cryptology -EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 474-490. Springer, 2005.
10. Stefan Lucks. A Failure-Friendly Design Principle for Hash Functions. In Bimal Roy, editor, Advances in Cryptology - ASIACRYPT 2005, volume 3788 of Lecture Notes in Computer Science, pages 474-494. Springer-Verlag, 2005.
11. David McGrew and John Viega. The Galois/Counter Mode of Operation (gem). NIST special publication, National Institute for Standards and Technology.
12. Alfred J. Menezes, Paul C. Van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography, chapter Hash Functions and Data Integrity, pages 321-383. The CRC Press series on discrete mathematics and its applications. CRC Press, 1997.
13. Ralph Merkle. One way hash functions and DES. In Gilles Brassard, editor, Advances in Cryptology: CRYPTO 89, volume 435 of Lecture Notes in Computer Science, pages 428-446. Springer-Verlag, 1989.
14. Bart Preneel. Analysis and design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, 1993.
15. Phillip Rogaway and Thomas Shrimpton. Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In Bimal K. Roy and Willi Meier, editors, Fast Software Encryption (FSE), volume 3017 of Lecture Notes in Computer Science, pages 371-388. Springer-Verlag, 2004.
16. Xiaoyun Wang, Dengguo Feng, Xuejia Lai, and Hongbo Yu. Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004/199, 2004. http://eprint.iacr.org/.
17. Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu. Efficient collision search attacks on SHA-0. In Victor Shoup, editor, Advances in Cryptology - CRYPTO '05, volume 3621 of Lecture Notes in Computer Science, pages 1-16. Springer, 2005, 14-18 August 2005.
18. Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu. Finding collisions in the full SHA-1. In Victor Shoup, editor, Advances in Cryptology-CRYPTO '05, volume 3621 of Lecture Notes in Computer Science, pages 17-36. Springer, 2005, 14-18 August 2005.
19. Xiaoyun Wang and Hongbo Yu. How to Break MD5 and Other Hash Functions. In Ronald Cramer, editor, Advances in Cryptology - EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 19-35. Springer, 2005.