Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security

Abstract : The Zémor-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 Zémor 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 Zémor-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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00386479
Contributor : Gilles Zémor <>
Submitted on : Thursday, May 21, 2009 - 10:52:03 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM

Links full text

Identifiers

Collections

CNRS | INRIA | IMB

Citation

Petit Christophe, Jean-Jacques Quisquater, Jean-Pierre Tillich, Gilles Zémor. Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security. CT-RSA 2009, Apr 2009, San Francisco, United States. pp.182--194, ⟨10.1007/978-3-642-00862-7_12⟩. ⟨hal-00386479⟩

Share

Metrics

Record views

311