Finding good differential patterns for attacks on SHA-1
Data(s) |
2006
|
---|---|
Resumo |
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. |
Identificador | |
Publicador |
Springer |
Relação |
DOI:10.1007/11779360_14 Matusiewicz, Krystian & Pieprzyk, Josef (2006) Finding good differential patterns for attacks on SHA-1. Lecture Notes in Computer Science, 3969, pp. 164-177. |
Fonte |
School of Electrical Engineering & Computer Science; Science & Engineering Faculty |
Tipo |
Journal Article |