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

DOI10.1007/978-3-642-00862-7_12zbMath1237.94085OpenAlexW1660058531WikidataQ62047268 ScholiaQ62047268MaRDI QIDQ3623044

Jean-Jacques Quisquater, Gilles Zémor, Jean-Pierre Tillich, Christophe Petit

Publication date: 29 April 2009

Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_12

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

\(\mathrm{SL}_2\) homomorphic hash functions: worst case to average case reduction and short collision search ⋮ Cryptanalysis of the Tillich-Zémor hash function ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Interpreting Hash Function Security Proofs ⋮ New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\) ⋮ Ramanujan Graphs for Post-Quantum Cryptography ⋮ Preimages for the Tillich-Zémor Hash Function

Cites Work

• Factoring polynomials with rational coefficients
• Attacking the SL 2 hashing scheme
• A note on the hash function of Tillich and zémor
• On the Security of the Hashing Scheme Based on SL 2
• Unnamed Item
• Unnamed Item
• Unnamed Item

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