Collisions for the LPS Expander Graph Hash Function

We analyse the hash function family based on walks in LPS Ramanujan graphs recently introduced by Charles et al. We present an algorithm for finding collisions that runs in quasi-linear time in the length of the hashed value. A concrete instance of the hash function is considered, based on a 100-digit prime. A short collision is given, together with implementation details.

[1]  P. Sarnak.  Some Applications of Modular Forms , 1990 .

[2]  Thomas Beth,et al.  Weaknesses in the SL2(IF2n) hashing scheme , 2000 .

[3]  Marc Joye,et al.  Authentication of Sequences with the SL2 Hash Function: Application to Video Sequences , 1997, J. Comput. Secur..

[4]  Donald W. Davies,et al.  Advances in Cryptology — EUROCRYPT ’91 , 2001, Lecture Notes in Computer Science.

[5]  Byoungcheon Lee,et al.  Information Security and Cryptology - ICISC 2006, 9th International Conference, Busan, Korea, November 30 - December 1, 2006, Proceedings , 2006, ICISC.

[6]  Kristin E. Lauter,et al.  Cryptographic Hash Functions from Expander Graphs , 2008, Journal of Cryptology.

[7]  H. A. Helfgott.  Growth and generation in SL_2(Z/pZ) , 2005 .

[8]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[9]  Mihir Bellare.  Advances in Cryptology — CRYPTO 2000 , 2000, Lecture Notes in Computer Science.

[10]  Vladimir Shpilrain.  Hashing with Polynomials , 2006, ICISC.

[11]  Tsutomu Matsumoto,et al.  Incidence structures for key sharing , 1995 .

[12]  Gilles Zémor,et al.  Hash Functions And Graphs With Large Girths , 1991, EUROCRYPT.

[13]  Gilles Zémor,et al.  Hashing with SL_2 , 1994, CRYPTO.

[14]  Giuliana P. Davidoff,et al.  Elementary number theory, group theory, and Ramanujan graphs , 2003 .

[15]  M. Murty.  Ramanujan Graphs , 1965 .

[16]  Yvo Desmedt,et al.  Advances in Cryptology — CRYPTO ’94 , 2001, Lecture Notes in Computer Science.

[17]  Gerhard Goos,et al.  Fast Software Encryption , 2001, Lecture Notes in Computer Science.

[18]  Markus Grassl,et al.  Weaknesses in the SL2(IFs2) Hashing Scheme , 2000, CRYPTO.

[19]  Gilles Zémor.  Hash functions and Cayley graphs , 1994, Des. Codes Cryptogr..

[20]  Chris Charnes,et al.  Attacking the SL2 Hashing Scheme , 1994, ASIACRYPT.

[21]  Willi Geiselmann.  A Note on the Hash Function of Tillich and Zémor , 1995, IMACC.

[22]  Chul Kim,et al.  On the Security of the Hashing Scheme Based on SL2 , 1998, FSE.

[23]  H. Helfgott.  Growth and generation in $\mathrm{SL}_2(\mathbb{Z}/p \mathbb{Z})$ , 2008 .

[24]  Gilles Zémor,et al.  Group-theoretic hash functions , 1993, Algebraic Coding.