Sur la complexité des suites infinies, Bull. Belg. Math. Soc, vol.1, pp.133-143, 1994. ,
Seven-Property-Preserving Iterated Hashing: ROX, ASIACRYPT'07, vol.4833, pp.130-146, 2007. ,
Multi-Property-Preserving Hash Domain Extension and the EMD Transform, vol.30, pp.299-314 ,
Collision-Resistant Hashing: Towards Making UOWHFs Practical, Lecture Notes in Computer Science, vol.1294, pp.470-484, 1997. ,
Collisions of SHA-0 and Reduced SHA-1, pp.36-57 ,
A Framework for Iterative Hash Functions -HAIFA. Presented at the second NIST hash workshop, 2006. ,
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers, Lecture Notes in Computer Science, vol.1976, pp.1-13, 2000. ,
, CRYPTO '89, vol.435, 1989.
Uniform tag seqences, Mathematical Systems Theory, vol.6, issue.3, pp.164-192, 1972. ,
Merkle-damgård revisited: How to construct a hash function, CRYPTO'05, pp.430-448, 2005. ,
, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol.3494, 2005.
A Design Principle for Hash Functions, pp.416-427 ,
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search, Selected Areas in Cryptography, vol.4876, pp.56-73, 2007. ,
Finding SHA-1 Characteristics: General Results and Applications ,
Preimages for Reduced SHA-0 and SHA-1, Lecture Notes in Computer Science, vol.5157, pp.179-202, 2008. ,
Formal Aspects of Mobile Code Security, 1999. ,
Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions, Theor. Comput. Sci, vol.1, issue.1, pp.59-75, 1975. ,
, An Introduction to Probability Theory and Its Applications, vol.1, p.12, 1971.
, The Skein Hash Function Family. Submission to NIST, 2008.
Strengthening Digital Signatures Via Randomized Hashing, Lecture Notes in Computer Science, vol.4117, pp.41-59, 2006. ,
A Cryptanalytic Time-Memory Trade Off, IEEE Transactions on Information Theory, vol.26, pp.401-406, 1980. ,
On average sequence complexity, Theor. Comput. Sci, vol.326, issue.1-3, pp.213-227, 2004. ,
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions, CRYPTO'04, vol.3152, pp.306-316, 2004. ,
Improved Generic Algorithms for 3-Collisions, vol.34, pp.347-363 ,
Hash Functions and the (Amplified) Boomerang Attack, Lecture Notes in Computer Science, vol.4622, pp.244-263, 2007. ,
Herding Hash Functions and the Nostradamus Attack, Lecture Notes in Computer Science, vol.4004, pp.183-200, 2006. ,
Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work ,
Abelian Squares are Avoidable on 4 Letters, Lecture Notes in Computer Science, vol.623, pp.41-52, 1992. ,
Tunnels in Hash Functions: MD5 Collisions Within a Minute, Cryptology ePrint Archive, issue.105, 2006. ,
, 12th International Conference on the Theory and Application of Cryptology and Information Security, vol.4284, 2006.
Md4 is not one-way, Lecture Notes in Computer Science, vol.5086, pp.412-428, 2008. ,
Practical key-recovery attack against APOP, an MD5-based challenge-response authentication, IJACT, vol.1, issue.1, pp.32-46, 2008. ,
A Failure-Friendly Design Principle for Hash Functions, Lecture Notes in Computer Science, vol.3788, pp.474-494, 2005. ,
, Advances in Cryptology -ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, vol.5912, 2009.
Rebound attack on the full lane compression function, pp.106-125 ,
Improved Cryptanalysis of the Reduced Grøstl Compression Function, ECHO Permutation and AES Block Cipher, Selected Areas in Cryptography, vol.5867, pp.16-35, 2009. ,
The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl, Lecture Notes in Computer Science, vol.5665, pp.260-276, 2009. ,
,
One Way Hash Functions and DES, pp.428-446 ,
Universal One-Way Hash Functions and their Cryptographic Applications, pp.33-43, 1989. ,
Complexité des Facteurs des Mots Infinis Engendrés Par Morphismes Itérés, 11th ICALP, vol.172, pp.380-389, 1984. ,
Non-repetitive sequences, Mat. Proc. Camb. Phil. Soc, vol.68, pp.267-274, 1970. ,
Abelian Square-Free Dithering for Iterated Hash Functions. Presented at ECRYPT Hash Function Workshop, 2005. ,
Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance, Lecture Notes in Computer Science, vol.3017, pp.371-388, 2004. ,
Finding preimages in full md5 faster than exhaustive search, Lecture Notes in Computer Science, vol.5479, pp.134-152, 2009. ,
A Composition Theorem for Universal One-Way Hash Functions, EUROCRYPT'00, vol.1807, pp.445-452, 2000. ,
, Advances in Cryptology -CRYPTO 2005: 25th Annual International Cryptology Conference, vol.3621, 2005.
Cryptanalysis of the Hash Functions MD4 and RIPEMD, vol.11, pp.1-18 ,
Finding Collisions in the Full SHA-1, pp.17-36 ,
How to Break MD5 and Other Hash Functions, pp.19-35 ,
Efficient Collision Search Attacks on SHA-0, vol.47, pp.1-16 ,