## CryptoDB

### Paper: Finding good differential patterns for attacks on SHA-1

Authors: Krystian Matusiewicz Josef Pieprzyk URL: http://eprint.iacr.org/2004/364 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2004-12327,
title={Finding good differential patterns for attacks on SHA-1},
booktitle={IACR Eprint archive},
keywords={hash functions, cryptanalysis, SHA-1, collisions, linear code},
url={http://eprint.iacr.org/2004/364},
note={ kmatus@ics.mq.edu.au 12771 received 19 Dec 2004},
author={Krystian Matusiewicz and Josef Pieprzyk},
year=2004
}