Name
Abstract | ||
|---|---|---|
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article1 is to sophisticate and improve Wang's attack by using algebraic techniques. We introduce new notions, namely semi-neutral bit and adjuster and propose then an improved message modification technique based on algebraic techniques. In the case of the 58-round SHA-1, the experimental complexity of our improved attack is 231 SHA-1 computations, whereas Wang's method needs 234 SHA-1 computations. We have found many new collisions for the 58-round SHA-1. We also study the complexity of our attack for the full SHA-1. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74619-5_22 | FSE |
Keywords | Field | DocType |
sha-1 computation,experimental complexity,new collision,new attack,algebraic technique,improved message modification technique,new notion,improved attack,full sha-1,algebraic cryptanalysis,58-round sha-1,grobner basis,sha 1 | Algebraic number,Algebra,SHA-1,Algebraic cryptanalysis,Theoretical computer science,Gröbner basis,Mathematics,Computation | Conference |
Volume | ISSN | ISBN |
4593 | 0302-9743 | 3-540-74617-X |
Citations | PageRank | References |
14 | 0.87 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| makoto sugita | 1 | 125 | 10.05 |
| Mitsuru Kawazoe | 2 | 92 | 8.09 |
| Ludovic Perret | 3 | 546 | 39.06 |
| Hideki Imai | 4 | 615 | 43.56 |