User menu

Hard and easy components of collision search in the Zemor-Tillich hash function: new attacks and reduced variants with equivalent security

Bibliographic reference Petit, Christophe ; Quisquater, Jean-Jacques ; Tillich, Jean-Pierre ; Zemor, Gilles. Hard and easy components of collision search in the Zemor-Tillich hash function: new attacks and reduced variants with equivalent security.Topics in Cryptology - CT-RSA 2009 (San Francisco (CA, USA), du 20/04/2009 au 24/04/2009). In: Fischlin, M., Proceedings of Topics in Cryptology - CT-RSA 2009, Springer-verlag2009, p.182-194
Permanent URL http://hdl.handle.net/2078.1/67574
  1. Abdukhalikov Kanat S., Kim Chul, On the Security of the Hashing Scheme Based on SL 2, Fast Software Encryption (1998) ISBN:9783540642657 p.93-102, 10.1007/3-540-69710-1_7
  2. Charnes Chris, Pieprzyk Josef, Attacking the SL 2 hashing scheme, Advances in Cryptology — ASIACRYPT'94 (1995) ISBN:9783540593393 p.322-330, 10.1007/bfb0000444
  3. Geiselmann Willi, A note on the hash function of Tillich and zémor, Fast Software Encryption (1996) ISBN:9783540608653 p.51-52, 10.1007/3-540-60865-6_42
  4. Lenstra A. K., Lenstra H. W., Lov�sz L., Factoring polynomials with rational coefficients, 10.1007/bf01457454
  5. Petit Christophe, Veyrat-Charvillon Nicolas, Quisquater Jean-Jacques, Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function, 10.1109/icecs.2008.4675001
  6. Quisquater Jean-Jacques, Delescaille Jean-Paul, How easy is collision search? Application to DES, Lecture Notes in Computer Science ISBN:9783540534334 p.429-434, 10.1007/3-540-46885-4_43
  7. Shamir, A.: Random graphs in cryptography. In: Invited talk at Asiacrypt 2006 (2006)
  8. Steinwandt Rainer, Grassl Markus, Geiselmann Willi, Beth Thomas, Weaknesses in the SL2($$ \mathbb{F}_{2^n } $$) Hashing Scheme, Advances in Cryptology — CRYPTO 2000 (2000) ISBN:9783540679073 p.287-299, 10.1007/3-540-44598-6_18
  9. Tillich Jean-Pierre, Zémor Gilles, Hashing with SL 2, Advances in Cryptology — CRYPTO ’94 ISBN:9783540583332 p.40-49, 10.1007/3-540-48658-5_5
  10. Wagner David, A Generalized Birthday Problem, Advances in Cryptology — CRYPTO 2002 (2002) ISBN:9783540440505 p.288-304, 10.1007/3-540-45708-9_19
  11. Yuval Gideon, HOW TO SWINDLE RABIN, 10.1080/0161-117991854025