Name
Abstract | ||
|---|---|---|
This paper shows preimage attacks on one-block MD4 and MD5 reduced to 63 (out of 64) steps. Our attacks are based on the meet-in-the-middle attack, and many additional improvements make the preimage computable faster than that of the brute-force attack, 2128 hash computation. A preimage of one-block MD4 can be computed in the complexity of the 2107 MD4 compression function computation, and a preimage of MD5 reduced to 63 steps can be computed in the complexity of the 2121 MD5 compression function computation. Moreover, we optimize the computational order of the brute-force attack against MD5, and a preimage of full-round MD5 can be computed in the complexity of the 2127 MD5 compression function computation. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-04159-4_7 | Selected Areas in Cryptography |
Keywords | Field | DocType |
preimage attacks,meet-in-the-middle,local collision,preimage.,md5 compression function computation,brute-force attack,md4 compression function computation,meet-in-the-middle attack,63-step md5,full-round md5,hash computation,additional improvement,one-way,one-block md4,md4,compression function computation. keywords: md5,preimage attack,preimage computable | Computer science,Algorithm,Theoretical computer science,MD4,Meet-in-the-middle attack,Hash function,Image (mathematics),MD5,Preimage attack,Collision attack,Computation | Conference |
Volume | ISSN | Citations |
5381 | 0302-9743 | 91 |
PageRank | References | Authors |
3.22 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kazumaro Aoki | 1 | 918 | 67.72 |
| Yu Sasaki | 2 | 247 | 15.33 |