Exploiting coding theory for collision attacks on SHA-1

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

Volumn 3796 LNCS, Issue , 2005, Pages 78-95

  Pramstaller, Norbert ^a   Rechberger, Christian ^a   Rijmen, Vincent ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Collision; Cryptanalysis; Hash function; Linear code; Low weight vector; SHA 1

Indexed keywords

CODES (SYMBOLS); COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; LINEAR SYSTEMS;

CRYPTANALYSIS; HASH FUNCTION; LINEAR CODE; LOW-WEIGHT VECTOR; SHA-1;

IMAGE CODING;

EID: 33646824396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11586821_7     Document Type: Conference Paper

References (17)

1. Eli Biham and Rafi Chen. Near-Collisions of SHA-0. In Proceedings of CRYPTO 2004, volume 3152 of LNCS, pages 290-305. Springer, 2004.
2. Eli Biham, Rafi Chen, Antoine Joux, Patrick Carribault, Christophe Lemuet, and William Jalby. Collisions of SHA-0 and Reduced SHA-1. In Proceedings of EUROCRYPT 2005, volume 3494 of LNCS, pages 36-57. Springer, 2005.
3. Anne Canteaut and Florent Chabaud. A New Algorithm for-Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511. IEEE Transactions on Information Theory, 44(1): 367-378, 1998.
4. Florent Chabaud. On the Security of Some Cryptosystems Based on Error-correcting Codes. In Proceedings of EUROCRYPT '94, volume 950 of LNCS, pages 131-139. Springer, 1995.
5. Florent Chabaud and Antoine Joux. Differential Collisions in SHA-0. In Proceedings of CRYPTO '98, volume 1462 of LNCS, pages 56-71. Springer, 1998.
6. Hans Dobbertin. Cryptanalysis of MD4. In Proceedings of Fast Software Encryption, volume 1039 of LNCS, pages 53-69. Springer, 1996.
7. Antoine Joux, Patrick Carribault, William Jalby, and Christophe Lemuet. Full iterative differential collisions in SHA-0, 2004. Preprint.
8. Vlastimil Klima. Finding MD5 Collisions on a Notebook PC Using Multi-message Modifications, 2005. Preprint, available at http://eprint.iacr. org/2005/102.
9. Jeffrey S. Leon. A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory, 34(5):1354-1359, 1988.
10. Krystian Matusiewicz and Josef Pieprzyk. Finding good differential patterns for attacks on SHA-1. In Proceedings of WCC 2005. Available online at http://www.ics.mq.edu.au/-kmatus/FindingGD.pdf.
11. National Institute of Standards and Technology (NIST). FIPS-180-2: Secure Hash Standard, August 2002. Available online at http://www.itl.nist.gov/ fipspubs/.
12. Vincent Rijmen and Elisabeth Oswald. Update on SHA-1. In Proceedings of CTRSA 2005, volume 3376 of LNCS, pages 58-71. Springer, 2005.
13. Jacques Stern. A method for finding codewords of small weight. In Proceedings of Coding Theory and Applications 1988, volume 388 of LNCS, pages 106-113. Springer, 1989.
14. Xiaoyun Wang, Dengguo Feng, Xuejia Lai, and Xiuyuan Yu. Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD, August 2004. Preprint, available at http://eprint.iacr.org/2004/199, presented at the Crypto 2004 rump session.
15. Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, and Xiuyuan Yu. Crypt-analysis for Hash Functions MD4 and RIPEMD. In Proceedings of EUROCRYPT 2005, volume 3494 of LNCS, pages 1-18. Springer, 2005.
16. Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu. Finding Collisions in the Full SHA-1. In Proceedings of CRYPTO 2005, volume 3621 of LNCS, pages 17-36. Springer,2005.
17. Xiaoyun Wang and Hongbo Yu. How to Break MD5 and Other Hash Functions. In Proceedings of EUROCRYPT 2005, volume 3494 of LNCS, pages 19-35. Springer, 2005.