Full Cryptanalysis of LPS and Morgenstern Hash Functions

DOI10.1007/978-3-540-85855-3_18zbMath1180.68155OpenAlexW1626445927WikidataQ62047275 ScholiaQ62047275MaRDI QIDQ3540051

Jean-Jacques Quisquater, Kristin E. Lauter, Christophe Petit

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

New constructions of collapsing hashes ⋮ Super-Golden-Gates for \(PU(2)\) ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Ramanujan Graphs in Cryptography ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ Better path-finding algorithms in LPS Ramanujan graphs ⋮ Interpreting Hash Function Security Proofs ⋮ New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\) ⋮ Cryptographic Hash Functions and Expander Graphs: The End of the Story? ⋮ Ramanujan Graphs for Post-Quantum Cryptography ⋮ Preimages for the Tillich-Zémor Hash Function ⋮ Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies ⋮ On the quaternion -isogeny path problem