Difference between revisions of "SHA-0"

@@ Line 128: / Line 128: @@
 === Preimage Attacks ===
+<bibtex>
+@inproceedings{cryptoCanniereR08,
+  author    = {Christophe De Canni{\`e}re and Christian Rechberger},
+  title     = {Preimages for Reduced SHA-0 and SHA-1},
+  booktitle = {CRYPTO},
+  year      = {2008},
+  pages     = {179-202},
+  abstract  = {In this paper, we examine the resistance of the popular hash function SHA-1 and its predecessor SHA-0 against dedicated preimage attacks. In order to assess the security margin of these hash functions against these attacks, two new cryptanalytic techniques are developed: (1) Reversing the inversion problem: the idea is to start with an impossible expanded message that would lead to the required digest, and then to correct this message until it becomes valid without destroying the preimage property. (2) P^3 graphs: an algorithm based on the theory of random graphs that allows the conversion of preimage attacks on the compression function to attacks on the hash function with less effort than traditional meet-in-the-middle approaches. Combining these techniques, we obtain preimage-style shortcuts attacks for up to 45 steps of SHA-1, and up to 50 steps of SHA-0 (out of 80). },
+  url        = {http://dx.doi.org/10.1007/978-3-540-85174-5_11},
+  editor    = {David Wagner},
+  publisher = {Springer},
+  series    = {LNCS},
+  volume    = {5157},
+  isbn      = {978-3-540-85173-8},
+}
+</bibtex>
 ----
 === Others ===

Latest revision as of 11:35, 10 November 2008