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

Petit, Christophe;Quisquater, Jean-Jacques
(2016) International conference on the new codebreakers : essays dedicated to David Kahn on the occasion of his 85th birthday — Location: Luxembourg

Files

document.pdf
  • Restricted Access
  • Adobe PDF
  • 164.73 KB
Request a copy

Details

Authors
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Petit, C., & Quisquater, J.-J. (2016). Cryptographic hash functions and expander graphs : the end of the story ? Lecture Notes in Computer Science, 9100, 304-311. https://doi.org/10.1007/978-3-662-49301-4_19 (Original work published 2016)