Sur la complexité des suites infinies, Bull. Belg. Math. Soc, vol.1, pp.133-143, 1994. ,
Seven-Property-Preserving Iterated Hashing: ROX, Lecture Notes in Computer Science, vol.4833, pp.130-146, 2007. ,
DOI : 10.1007/978-3-540-76900-2_8
URL : https://lirias.kuleuven.be/bitstream/123456789/228688/2/article-943.pdf
Collisions of SHA-0 and Reduced SHA-1, pp.36-57 ,
DOI : 10.1007/11426639_3
Uniform tag sequences, Mathematical Systems Theory, vol.5, issue.1-2, pp.164-192, 1972. ,
DOI : 10.1007/BF01706087
Advances in Cryptology -EUROCRYPT, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings EUROCRYPT'05, 2005. ,
A Design Principle for Hash Functions, pp.416-427 ,
DOI : 10.1007/0-387-34805-0_39
Formal Aspects of Mobile Code Security, 1999. ,
Subword complexities of various classes of deterministic developmental languages without interactions, Theoretical Computer Science, vol.1, issue.1, pp.59-75, 1975. ,
DOI : 10.1016/0304-3975(75)90012-2
In: An Introduction to Probability Theory and Its Applications, 1971. ,
A cryptanalytic time-memory trade-off, IEEE Transactions on Information Theory, vol.26, issue.4, pp.401-406, 1980. ,
DOI : 10.1109/TIT.1980.1056220
On the average sequence complexity, Data Compression Conference, 2004. Proceedings. DCC 2004, pp.213-227, 2004. ,
DOI : 10.1109/DCC.2004.1281518
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions, Lecture Notes in Computer Science, vol.3152, pp.306-316, 2004. ,
DOI : 10.1007/978-3-540-28628-8_19
Hash Functions and the (Amplified) Boomerang Attack, Lecture Notes in Computer Science, vol.4622, pp.244-263, 2007. ,
DOI : 10.1007/978-3-540-74143-5_14
Herding Hash Functions and the Nostradamus Attack, Lecture Notes in Computer Science, vol.4004, pp.183-200, 2006. ,
DOI : 10.1007/11761679_12
Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work, pp.474-490 ,
DOI : 10.1007/11426639_28
Abelian squares are avoidable on 4 letters, Lecture Notes in Computer Science, vol.623, pp.41-52, 1992. ,
DOI : 10.1007/3-540-55719-9_62
On abelian square-free DT0L-languages over 4 letters, WORDS'03, pp.95-109, 2003. ,
Tunnels in Hash Functions: MD5 Collisions Within a Minute, Cryptology ePrint Archive Report, vol.105, 2006. ,
Handbook of Applied Cryptography 21, Merkle, R.C.: One Way Hash Functions and DES, pp.428-446 ,
Hash Functions: From Merkle-Damg??rd to Shoup, Lecture Notes in Computer Science, vol.2045, pp.166-181, 2001. ,
DOI : 10.1007/3-540-44987-6_11
A Framework for Iterative Hash Functions ? HAIFA. Presented at the second NIST hash workshop, 2006. ,
Complexit?? des facteurs des mots infinis engendr??s par morphismes it??r??s, 11th ICALP, pp.380-389, 1984. ,
DOI : 10.1007/3-540-13345-3_34
Abelian Square-Free Dithering for Iterated Hash Functions. Presented at ECrypt Hash Function Workshop, Cracow, and at the Cryptographic Hash workshop, 2005. ,
A Composition Theorem for Universal One-Way Hash Functions, EUROCRYPT'00, pp.445-452, 2000. ,
DOI : 10.1007/3-540-45539-6_32
Advances in Cryptology, CRYPTO 2005: 25th Annual International Cryptology Conference Proceedings, 2005. ,
Cryptanalysis of the Hash Functions MD4 and RIPEMD, pp.1-18 ,
DOI : 10.1007/11426639_1
Finding Collisions in the Full SHA-1, pp.17-36 ,
DOI : 10.1007/11535218_2
How to Break MD5 and Other Hash Functions, pp.19-35 ,
DOI : 10.1007/11426639_2
Efficient Collision Search Attacks on SHA-0, pp.1-16 ,
DOI : 10.1007/11535218_1