Cryptographic Hash Functions and Expander Graphs: The End of the Story?
From MaRDI portal
Publication:2803636
DOI10.1007/978-3-662-49301-4_19zbMath1405.94081OpenAlexW2463230411WikidataQ62047240 ScholiaQ62047240MaRDI QIDQ2803636
Jean-Jacques Quisquater, Christophe Petit
Publication date: 2 May 2016
Published in: The New Codebreakers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49301-4_19
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear approximate groups.
- Diameters of Cayley graphs of Chevalley groups
- Small-diameter Cayley graphs for finite simple groups
- Cryptographic hash functions from expander graphs
- The complexity of finding minimum-length generator sequences
- Ramanujan graphs
- On the diameter of permutation groups
- Some large trivalent graphs having small diameters
- Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem
- Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
- Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).
- Cryptanalysis of the Tillich-Zémor hash function
- On the diameter of permutation groups.
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- Navigating in the Cayley graphs of \(\text{SL}_N(\mathbb{Z})\) and \(\text{SL}_N(\mathbb{F}_p)\).
- Preimages for the Tillich-Zémor Hash Function
- Group theory in cryptography
- Expander graphs in pure and applied mathematics
- Rubik’s for Cryptographers
- Poly-log diameter bounds for some families of finite groups
- Growth in finite simple groups of Lie type
- Cryptanalysis of short RSA secret exponents
- Expander graphs and their applications
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- The minimum-length generator sequence problem is NP-hard
- Collisions for the LPS Expander Graph Hash Function
This page was built for publication: Cryptographic Hash Functions and Expander Graphs: The End of the Story?
