Name
Abstract | ||
|---|---|---|
Iterated Halving has been suggested as a replacement to the Merkle-Damgård construction following attacks on the MDx family of hash functions. The core of the scheme is an iterated block cipher that provides keying and input material for future rounds. The CRUSH hash function provides a specific instantiation of the block cipher for Iterated Halving. In this paper, we identify structural problems with the scheme, and show that by using a bijective function, such as the block cipher used in CRUSH or the AES, we can trivially identify collisions and second preimages on many equal-length messages of length ten blocks or more. The cost is ten decryptions of the block cipher, this being less than the generation of a single digest. We show that even if Iterated Halving is repaired, the construction has practical issues that means it is not suitable for general deployment. We conclude this paper with the somewhat obvious statement that CRUSH, and more generally Iterated Halving, should not be used. |
Year | Venue | Keywords |
|---|---|---|
2007 | Selected Areas in Cryptography | equal-length message,MDx family,hash function,CRUSH hash function,iterated block cipher,block cipher,rd construction,bijective function,Iterated Halving,future round |
DocType | Volume | ISSN |
Conference | 4876 | 0302-9743 |
ISBN | Citations | PageRank |
3-540-77359-2 | 1 | 0.37 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matt Henricksen | 1 | 131 | 13.55 |
| Lars R. Knudsen | 2 | 319 | 22.63 |