Další výzkum diferenciálních charakteristik SHA-0 a SHA-1
20.12.2004
Zatím žádný praktický výsledek:
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.
