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

Christophe Petit; Jean-Jacques Quisquater

doi:10.1007/978-3-662-49301-4_19

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

Christophe Petit, Jean-Jacques Quisquater

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

1 Citation (Scopus)

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.

Original language	English
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
Publisher	Springer
Pages	304-311
ISBN (Electronic)	9783662493014
ISBN (Print)	9783662493007
DOIs	https://doi.org/10.1007/978-3-662-49301-4_19
Publication status	Published - 18 Mar 2016

Publication series

Name	Lecture Notes in Computer Science
Volume	9100
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-662-49301-4_19

http://link.springer.com/10.1007/978-3-662-49301-4_19

Cite this

Petit, C., & Quisquater, J-J. (2016). Cryptographic Hash Functions and Expander Graphs: The End of the Story? In P. Y. A. Ryan, D. Naccache, & J-J. Quisquater (Eds.), The New Codebreakers: Essays Dedicated to David Kahn on the Occasion of His 85th Birthday (pp. 304-311). (Lecture Notes in Computer Science; Vol. 9100). Springer. https://doi.org/10.1007/978-3-662-49301-4_19

@inbook{c502380b4d204d74887d5e6bd8ec766f,

title = "Cryptographic Hash Functions and Expander Graphs: The End of the Story?",

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.",

author = "Christophe Petit and Jean-Jacques Quisquater",

year = "2016",

month = mar,

day = "18",

doi = "10.1007/978-3-662-49301-4_19",

language = "English",

isbn = "9783662493007",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "304--311",

editor = "Ryan, {Peter Y.A.} and David Naccache and {Quisquater }, {Jean-Jacques }",

booktitle = "The New Codebreakers",

}

Cryptographic Hash Functions and Expander Graphs: The End of the Story? / Petit, Christophe; Quisquater, Jean-Jacques.
The New Codebreakers: Essays Dedicated to David Kahn on the Occasion of His 85th Birthday. ed. / Peter Y.A. Ryan; David Naccache; Jean-Jacques Quisquater . Springer, 2016. p. 304-311 (Lecture Notes in Computer Science; Vol. 9100).