Abstract
In this article we find collisions for step-reduced SHA-256. We develop a differential that holds with high probability if the message satisfies certain conditions. We solve the equations that arise from the conditions. Due to the carefully chosen differential and word differences, the message expansion of SHA-256 has little effect on spreading the differences in the words. This helps us to find full collision for 21-step reduced SHA-256, semi-free start collision, i.e. collision for a different initial value, for 23-step reduced SHA-256, and semi-free start near collision (with only 15 bit difference out of 256 bits) for 25-step reduced SHA-256. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Nikolić, I., & Biryukov, A. (2008). Collisions for step-reduced SHA-256. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5086 LNCS, pp. 1–15). https://doi.org/10.1007/978-3-540-71039-4_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
