International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1

Authors:
Stephane Manuel
Download:
URL: http://eprint.iacr.org/2008/469
Search ePrint
Search Google
Abstract: In this paper, we present a deterministic algorithm to produce disturbance vectors for collision attacks against SHA-1. We show that all published disturbance vectors can be classified into two types of vectors, type-I and type-II. We define a cost function, close to those described in \cite{Mendel06}, to evaluate the complexity of a collision attack for a given disturbance vector. Using the classification and the cost function we made an exhaustive search which allowed us to retrieve all known vectors. We also found new vectors which have lower cost. This may lead to the best collision attack against SHA-1, with a theoretical attack complexity of $2^{51}$ hash function calls.
BibTeX
@misc{eprint-2008-18127,
  title={Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1},
  booktitle={IACR Eprint archive},
  keywords={Hash Functions, SHA-1, Collision Attack, Disturbance Vector.},
  url={http://eprint.iacr.org/2008/469},
  note={ stephane.manuel@inria.fr 14187 received 4 Nov 2008},
  author={Stephane Manuel},
  year=2008
}