The first collision for full SHA-1
SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated by NIST in 2011 due to fundamental security weaknesses demonstrated in various analyses and theoretical attacks. Despite its deprecation, SHA-1 remains widely used in 2017 for document and TLS certificate signatures, and also in many software such as the GIT versioning system for integrity and backup purposes. A key reason behind the reluctance of many industry players to replace SHA-1 with a safer alternative is the fact that finding an actual collision has seemed to be impractical for the past eleven years due to the high complexity and computational cost of the attack. In this paper, we demonstrate that SHA-1 collision attacks have finally become practical by providing the first known instance of a collision. Furthermore, the prefix of the colliding messages was carefully chosen so that they allow an attacker to forge two distinct PDF documents with the same SHA-1 hash that display different arbitrarily-chosen visual contents. We were able to find this collision by combining many special cryptanalytic techniques in complex ways and improving upon previous work. In total the computational effort spent is equivalent to 263.1 calls to SHA-1’s compression function, and took approximately 6500 CPU years and 100 GPU years. While the computational power spent on this collision is larger than other public cryptanalytic computations, it is still more than 100 000 times faster than a brute force search.
|Keywords||Collision attack, Collision example, Cryptanalysis, Differential path construction, Hash function|
|Stakeholder||Google Research, Mountain View, USA|
|Project||Applications of Arithmetic Secret Sharing Schemes in Two-Party Cryptography , Cryptanalysis of Widely-used Hash Function Standards and Beyond|
|Conference||Annual International Cryptology Conference|
|Grant||This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/617.023.117 - Applications of Arithmetic Secret Sharing Schemes in Two-Party Cryptography, This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/617.001.201 - Cryptanalysis of Widely-used Hash Function Standards and Beyond|
Stevens, M.M.J, Bursztein, E, Karpman, P, Albertini, A, & Markov, Y. (2017). The first collision for full SHA-1. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 570–596). doi:10.1007/978-3-319-63688-7_19