Cryptology ePrint Archive: Report 2004/364

Finding good differential patterns for attacks on SHA-1

Krystian Matusiewicz and Josef Pieprzyk

Abstract: In this paper we 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 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.

Category / Keywords: hash functions, cryptanalysis, SHA-1, collisions, linear code

Date: received 19 Dec 2004

Contact author: kmatus at ics mq edu au

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20041220:174631 (All versions of this report)

Discussion forum: Show discussion | Start new discussion