Cryptographic hash functions and expander graphs: the end of the story?

DOI10.1007/978-3-662-49301-4_19zbMATH Open1405.94081DBLPconf/birthday/PetitQ16OpenAlexW2463230411WikidataQ62047240 ScholiaQ62047240MaRDI QIDQ2803636FDOQ2803636

Authors: 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

Recommendations

• Recent developments in Cayley hash functions
• Hash functions and Cayley graphs
• Cryptographic hash functions from expander graphs
• Cryptographic hash functions from sequences of lifted Paley graphs
• Cryptographic Hash Functions and Some Applications to Information Security

zbMATH Keywords

expander graphsCayley hash functions

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Expander graphs in pure and applied mathematics
• Cryptanalysis of short RSA secret exponents
• Expander graphs and their applications
• Ramanujan graphs
• Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).
• Cryptographic hash functions from expander graphs
• Cryptanalysis of the Tillich-Zémor hash function
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
• Rubik’s for Cryptographers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Full Cryptanalysis of LPS and Morgenstern Hash Functions
• Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
• Preimages for the Tillich-Zémor hash function
• Group theory in cryptography
• Growth in finite simple groups of Lie type
• Small-diameter Cayley graphs for finite simple groups
• On the diameter of permutation groups.
• Linear approximate groups.
• Poly-log diameter bounds for some families of finite groups
• On the diameter of permutation groups
• Diameters of Cayley graphs of Chevalley groups
• Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
• The minimum-length generator sequence problem is NP-hard
• Collisions for the LPS Expander Graph Hash Function
• The complexity of finding minimum-length generator sequences
• Title not available (Why is that?)
• Some large trivalent graphs having small diameters
• Navigating in the Cayley graphs of \(\text{SL}_N(\mathbb{Z})\) and \(\text{SL}_N(\mathbb{F}_p)\).
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem

Cited In (5)

• Applications of finite non-abelian simple groups to cryptography in the quantum era
• New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\)
• Security aspects of the Cayley hash function using discrete Heisenberg group
• Cryptographic hash functions from expander graphs
• Recent developments in Cayley hash functions

This page was built for publication: Cryptographic hash functions and expander graphs: the end of the story?

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