Cryptographic Hash Functions from Expander Graphs

By D. Charles, Kristin E. Lauter, Eyal Z. Goren. Journal of Cryptology, 2008

444 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/f27facd6cb05318bce7e75f173cb62687d9a6d6f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Tanja Lange

In Artificial Intelligence

1. Wouter Castryck
2. Tanja Lange
3. Lorenz Panny
4. Joost Renes
5. Chloe Martindale
6. Thomas Decru

In Information Systems

1. Wouter Castryck
2. Tanja Lange
3. Thomas Decru

Citations in the corpus

• CSIDH: An Efficient Post-Quantum Commutative Group Action (2018, background): “It should be stressed that SIDH is not the Couveignes–Rostovtsev–Stolbunov scheme in which one substitutes supersingular elliptic curves for ordinary elliptic curves; in fact SIDH is much more reminiscent of a cryptographic hash function from 2006 due to Charles, Goren, and Lauter [11].”
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies (2011, background): “[9], which remains unbroken to date (the cryptanalysis of [30] applies only to the LPS graph-based hash function from [9], and not to the supersingular isogeny graph-based hash functions).”