Abstract
In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code. Finally, we present a number of patterns of different lengths suitable for finding collisions and near-collisions and discuss some bounds on minimal weights of them. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Matusiewicz, K., & Pieprzyk, J. (2006). Finding good differential patterns for attacks on SHA-1. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 164–177). Springer Verlag. https://doi.org/10.1007/11779360_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
