D. Augot, M. Finiasz, and N. Sendrier, A Family of Fast Syndrome Based Cryptographic Hash Functions, Lecture Notes in Computer Science, vol.3715, pp.64-83, 2005.
DOI : 10.1007/11554868_6
URL : https://hal.archives-ouvertes.fr/inria-00070414

M. Bellare and D. Micciancio, A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost, In: EUROCRYPT, pp.163-192, 1997.
DOI : 10.1007/3-540-69053-0_13

J. S. Coron and A. Joux, Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive, Report, p.13, 2004.

S. R. Finch, In: Mathematical Constants, pp.354-361, 2003.
DOI : 10.1017/CBO9780511550447

M. Finiasz, P. Gaborit, and N. Sendrier, Improved fast syndrome based cryptographic hash functions, 2007.

M. J. Saarinen, Linearization Attacks Against Syndrome Based Hashes, Cryptology ePrint Archive Report, vol.295, 2007.
DOI : 10.1007/978-3-540-77026-8_1

D. Wagner, A Generalized Birthday Problem, Lecture Notes in Computer Science, vol.2442, pp.288-303, 2002.
DOI : 10.1007/3-540-45708-9_19

X. Wang, Y. L. Yin, and H. Yu, Finding Collisions in the Full SHA-1, Lecture Notes in Computer Science, vol.3621, pp.17-36, 2005.
DOI : 10.1007/11535218_2

X. Wang and H. Yu, How to Break MD5 and Other Hash Functions, Lecture Notes in Computer Science, vol.3494, pp.19-35, 2005.
DOI : 10.1007/11426639_2