Name
Abstract | ||
|---|---|---|
This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. This paper has three main contributions; a preimage attack on 3-pass HAVAL at the complexity of 2225, a preimage attack on 4-pass HAVAL at the complexity of 2241, and a preimage attack on 5-pass HAVAL reduced to 151 steps at the complexity of 2241. Moreover, we optimize the computational order for brute-force attack on full 5-pass HAVAL and its complexity is 2254.89. As far as we know, the proposed attack on 3-pass HAVAL is the best attack and there is no preimage attack so far on 4-pass and 5-pass HAVAL. Note that the complexity of the previous best attack on 3-pass HAVAL is 2230. Technically, our attacks find pseudo-preimages of HAVAL by combining the meet-in-the-middle and local-collision approaches, then convert pseudo-preimages to a preimage by using a generic algorithm. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89255-7_16 | ASIACRYPT |
Keywords | Field | DocType |
preimage attacks,full 5-pass haval,hash function haval,4-pass haval,5-pass haval,best attack,proposed attack,3-pass haval,previous best attack,brute-force attack,preimage attack,haval,hash function,preimage,generic algorithm | Computer science,HAVAL,Theoretical computer science,MD4,Hash function,Image (mathematics),MD2,Genetic algorithm,Preimage attack,Meet in the middle | Conference |
Volume | ISSN | Citations |
5350 | 0302-9743 | 32 |
PageRank | References | Authors |
1.77 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Sasaki | 1 | 247 | 15.33 |
| Kazumaro Aoki | 2 | 918 | 67.72 |