SHA-1 Collision Search
Finding a colliding message pair for SHA-1 is one of the biggest challenges in practical cryptography. Due to recent progess of our cryptanalytic methods, we finally started a distributed computing project to tackle the problem.
More information
- The starting point for your contribution to the SHA-1 collision search project
- Background: some basics on hash functions, and a brief description of the approach
- Discussion on "Meaningful Collisions"
Our previous papers on this topic
| 2007 | Christophe De Cannière, Florian Mendel, Christian Rechberger - "Collisions for 70-step SHA-1: On the Full Cost of Collision Search" - Selected Areas in Cryptography |  |
 |
 |
| 2006 | Christophe De Cannière, Christian Rechberger - "Finding SHA-1 Characteristics: General Results and Applications" - Advances in Cryptology - Asiacrypt 2006 | |
 |
|
| 2006 | Florian Mendel, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen - "The Impact of Carries on the Complexity of Collision Attacks on SHA-1" - Fast Software Encryption (FSE) 2006 | |
|
 |
Recent talks/announcements
- Florian Mendel, Christian Rechberger, and Vincent Rijmen, Update on SHA-1. Crypto 2007 Rump Session, August 21, 2007
Older
First 64-step Collision for SHA-1 (May 2006)
First 70-step Collision for SHA-1 (January 2007)