Cryptology ePrint Archive: Report 2006/021

Cryptographic hash functions from expander graphs

Denis Charles and Eyal Goren and Kristin Lauter

Abstract: We propose constructing provable collision resistant hash functions from expander graphs. As examples, we investigate two specific families of optimal expander graphs for provable hash function constructions: the families of Ramanujan graphs constructed by Lubotzky-Phillips-Sarnak and Pizer respectively. When the hash function is constructed from one of Pizer's Ramanujan graphs, (the set of supersingular elliptic curves over ${\FF}_{p^2}$ with $\ell$-isogenies, $\ell$ a prime different from $p$), then collision resistance follows from hardness of computing isogenies between supersingular elliptic curves. We estimate the cost per bit to compute these hash functions, and we implement our hash function for several members of the LPS graph family and give actual timings.

Category / Keywords: cryptographic protocols / hash functions, supersingular elliptic curves, Ramanujan graphs

Date: received 23 Jan 2006

Contact author: klauter at microsoft com

Available formats: PDF | BibTeX Citation

Version: 20060123:205536 (All versions of this report)

Discussion forum: Show discussion | Start new discussion