Finding good differential patterns for attacks on SHA-1
Matusiewicz, Krystian & Pieprzyk, Josef (2006) Finding good differential patterns for attacks on SHA-1. Lecture Notes in Computer Science, 3969, pp. 164-177.
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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||Coding and Cryptography : International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers|
|Divisions:||Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Deposited On:||08 Jul 2014 02:37|
|Last Modified:||09 Jul 2014 07:04|
Repository Staff Only: item control page