In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and introduce the first results on SHA-1. The results include a generic multi-block technique that uses near-collisions in order to find collisions, and a four-block collision of SHA-0 found using this technique with complexity 251. Then, extension of this and prior techniques are presented, that allow us to find collisions of reduced versions of SHA-1. We give collisions of variants with up to 40 rounds, and show the complexities of longer variants. These techniques show that collisions up to about 53-58 rounds can still be found faster than by birthday attacks. © International Association for Cryptologic Research 2005.
CITATION STYLE
Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., & Jalby, W. (2005). Collisions of SHA-0 and reduced SHA-1. In Lecture Notes in Computer Science (Vol. 3494, pp. 36–57). Springer Verlag. https://doi.org/10.1007/11426639_3
Mendeley helps you to discover research relevant for your work.