Paper 2008/469 Original: eprint.iacr.org/2008/469 ↗
Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2008-11-18: last updated
- 2008-11-18: published
- Short URL
- https://ia.cr/2008/469
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/469,
author = {Stephane Manuel},
title = {Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/469},
year = {2008},
url = {https://eprint.iacr.org/2008/469}
}