Welcome to the resource topic for 2004/364
Title:
Finding good differential patterns for attacks on SHA-1
Authors: Krystian Matusiewicz, 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.
ePrint: https://eprint.iacr.org/2004/364
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .