You are looking at a specific version 20041220:174631 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- hash functionscryptanalysisSHA-1collisionslinear code
- Contact author(s)
- kmatus @ ics mq edu au
- History
- 2004-12-20: received
- Short URL
- https://ia.cr/2004/364
- License
-
CC BY