Finding Collisions in the Full SHA-1

By Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu. Annual International Cryptology Conference, 2005

1,657 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/abc63b4e03c548830092b056a317bd7ac51e5a47

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

Citations in the corpus

Charm: a framework for rapidly prototyping cryptosystems (2013, background): “Similarly, MD5 and SHA1 were discovered to contain vulnerabilities [74,75].”
Aegis: A Single-Chip Secure Processor (2007, background): “have also shown that collisions in the the full SHA-1 can be found in less than 269 hash operations, much less than the brute-force attack of 280 operations [144].”
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices (2006, background): “of many popular hash functions casts doubt on the heuristic approach [26, 25].”
New Proofs for NMAC and HMAC: Security without Collision Resistance (2006, background): “The reason is that collision-finding attacks such as those on MD5 [38] and SHA-1 [37] extend to find collisions in H∗(IV, ·) for an arbitrary but given IV, and, any such attack, via a further extension attack, can be used to compromise WCR, meaning to find a collision in H∗(K, ·), given an oracle fo”
Pioneer: verifying code integrity and enforcing untampered code execution on legacy systems (2005, background): “The collision resistance property of SHA-1 has been compromised [25].”
Biclique Cryptanalysis of the Full AES (2011, methodology): “In contrast, the area of hash function cryptanalysis is growing quickly, encouraged by the cryptanalysis of MD5 [48], of SHA-0 [6, 14] and SHA-1 [47], followed by a practical attack on protocols using MD5 [44, 45], preimage attacks on Tiger [28] and MD5 [43], etc.”
Finding SHA-1 Characteristics: General Results and Applications (2006, background): “Wang et al. describe in their seminal paper [20] an approach which is based on following and manipulating differences manually [23] in combination with a great deal of experience and intuition.”
Security and Cooperation in Wireless Networks (2007, background): “The interested reader is referred to [373, 372] for the details.”
Dynamic authenticated index structures for outsourced databases (2006, background): “SHA1 is currently considered collision-resistant in practice, despite some recent succesful attacks [18, 19].”
The First Collision for Full SHA-1 (2017, methodology): “[48], the main reason of using two block pairs (i.”