Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
| hal.structure.identifier | UCL Crypto Group Université catholique de Louvain | |
| dc.contributor.author | CHRISTOPHE, Petit | |
| hal.structure.identifier | UCL Crypto Group Université catholique de Louvain | |
| dc.contributor.author | QUISQUATER, Jean-Jacques | |
| hal.structure.identifier | Security, Cryptology and Transmissions [SECRET] | |
| dc.contributor.author | TILLICH, Jean-Pierre | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | ZÉMOR, Gilles | |
| dc.date.accessioned | 2024-04-04T02:38:30Z | |
| dc.date.available | 2024-04-04T02:38:30Z | |
| dc.date.created | 2009-04 | |
| dc.date.issued | 2009-04 | |
| dc.date.conference | 2009-04-20 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/190884 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.source.title | Topics in Cryptology – CT-RSA 2009 | |
| dc.title.en | Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-642-00862-7_12 | |
| dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
| bordeaux.page | 182--194 | |
| bordeaux.volume | 5473 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | CT-RSA 2009 | |
| bordeaux.country | US | |
| bordeaux.title.proceeding | Topics in Cryptology – CT-RSA 2009 | |
| bordeaux.conference.city | San Francisco | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00386479 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2009-04-24 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00386479v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Topics%20in%20Cryptology%20%E2%80%93%20CT-RSA%202009&rft.date=2009-04&rft.volume=5473&rft.spage=182--194&rft.epage=182--194&rft.au=CHRISTOPHE,%20Petit&QUISQUATER,%20Jean-Jacques&TILLICH,%20Jean-Pierre&Z%C3%89MOR,%20Gilles&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||