Cryptographic Hash Functions and Expander Graphs: The End of the Story?

Research output: Chapter in Book/Report/Conference proceedingChapter


Colleges, School and Institutes

External organisations

  • 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.


Original languageEnglish
Title of host publicationThe New Codebreakers
Subtitle of host publicationEssays Dedicated to David Kahn on the Occasion of His 85th Birthday
EditorsPeter Y.A. Ryan, David Naccache, Jean-Jacques Quisquater
Publication statusPublished - 18 Mar 2016

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349