The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, which makes comparison even harder. In situations where differences in estimates of attack complexity of a small factor might influence short-term recommendations of standardization bodies, uncertainties and ambiguities in the literature amounting to a similar order of magnitude are unhelpful. We survey different techniques and propose a simple but effective method to facilitate comparison. In a case study, we consider a newly developed attack on 70-step SHA-1, and give complexity estimates and performance measurements of this new and improved collision search method. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
De Cannière, C., Mendel, F., & Rechberger, C. (2007). Collisions for 70-step SHA-1: On the full cost of collision search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4876 LNCS, pp. 56–73). Springer Verlag. https://doi.org/10.1007/978-3-540-77360-3_4
Mendeley helps you to discover research relevant for your work.