Collisions for the LPS Expander Graph Hash Function

DOI10.1007/978-3-540-78967-3_15zbMATH Open1149.94330OpenAlexW1526708853MaRDI QIDQ5458596FDOQ5458596

Jean-Pierre Tillich, Gilles Zémor

Publication date: 15 April 2008

Published in: Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78967-3_15

Recommendations

• Collision-free hashing from lattice problems
• Cryptographic hash functions from expander graphs
• scientific article; zbMATH DE number 1024104
• Advances in Cryptology – CRYPTO 2004
• Theory of Cryptography
• Keyed hash function from large girth expander graphs
• scientific article
• New constructions of collapsing hashes
• Collisions for variants of the BLAKE hash function

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Expander graphs and their applications
• Ramanujan graphs
• Authentication of sequences with the SL2 hash function: application to video sequences
• A note on the hash function of Tillich and zémor
• Title not available (Why is that?)
• Cryptographic hash functions from expander graphs
• On the Security of the Hashing Scheme Based on SL 2
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hash functions and Cayley graphs
• Title not available (Why is that?)
• Attacking the SL 2 hashing scheme
• Title not available (Why is that?)
• Hashing with Polynomials

Cited In (13)

• Ramanujan Graphs for Post-Quantum Cryptography
• Preimages for the Tillich-Zémor Hash Function
• Full Cryptanalysis of LPS and Morgenstern Hash Functions
• New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\)
• Better path-finding algorithms in LPS Ramanujan graphs
• Interpreting Hash Function Security Proofs
• Hash Functions from Sigma Protocols and Improvements to VSH
• Keyed hash function from large girth expander graphs
• Ramanujan Graphs in Cryptography
• Constructing an efficient hash function from $3$-isogenies
• A characterization of chameleon hash functions and new, efficient designs
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
• Cryptographic Hash Functions and Expander Graphs: The End of the Story?

This page was built for publication: Collisions for the LPS Expander Graph Hash Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458596)