par Petit, Christophe
;Quisquater, Jean-Jacques;Tillich, Jean Pierre;Źemor, Gilles
Référence Lecture notes in computer science, 5473, page (182-194)
Publication Publié, 2009
;Quisquater, Jean-Jacques;Tillich, Jean Pierre;Źemor, GillesRéférence Lecture notes in computer science, 5473, page (182-194)
Publication Publié, 2009
Article révisé par les pairs
| Résumé : | 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. |



