Cryptographic Hash Functions and Expander Graphs: The End of the Story?
Research output: Chapter in Book/Report/Conference proceeding › Chapter
Colleges, School and Institutes
- University College London
- Université Catholique de Louvain, Louvain-la-Neuve, Belgium
Cayley hash functions are a family of cryptographic hash functions constructed from the Cayley graphs of non-Abelian finite groups. Their security relies on the hardness of mathematical problems related to long-standing conjectures in graph and group theory. We recall the Cayley hash design and known results on the underlying problems. We then describe related open problems, including the cryptanalysis of relevant parameters as well as new applications to cryptography and outside, assuming either that the problem is “hard” or easy.
|Title of host publication||The New Codebreakers|
|Subtitle of host publication||Essays Dedicated to David Kahn on the Occasion of His 85th Birthday|
|Editors||Peter Y.A. Ryan, David Naccache, Jean-Jacques Quisquater|
|Publication status||Published - 18 Mar 2016|
|Name||Lecture Notes in Computer Science|