Hard and easy components of collision search in the Zemor-Tillich hash function: new attacks and reduced variants with equivalent security
(2009) Topics in Cryptology - CT-RSA 2009 — Location: San Francisco (CA, USA) (20.April.2009)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 436.83 KB
Details
- Authors
- Abstract
- The Zemor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We present the first generic collision and preimage attacks against this function, in the sense that the attacks work for any parameters of the function. Their complexity is the cubic root of the birthday bound: for the parameters initially suggested by Tillich and Zemor they are very close to being practical. Our attacks exploit a separation of the collision problem into an easy and a hard component. We subsequently present two variants of the Zemor-Tillich hash function with essentially the same collision resistance but reduced outputs of 2n and n bits instead of the original 3n bits. Our second variant keeps only the hard component of the collision problem; for well-chosen parameters the best collision attack on it is the birthday attack.
- Affiliations
Citations
Petit, C., Quisquater, J.-J., Tillich, J.-P., & Zemor, G. (2009). Hard and easy components of collision search in the Zemor-Tillich hash function: new attacks and reduced variants with equivalent security. In Fischlin, M. (ed.), Proceedings of Topics in Cryptology - CT-RSA 2009 (pp. 182-194). Springer-verlag. https://doi.org/10.1007/978-3-642-00862-7_12