References

  1. K. Halunen, J. Kortelainen & Kortelainen T. (2009): Multicollision Attacks on Generalized Iterated Hash Functions. In: Eight Australasian Information Security Conference (AISC2010), Australian Computer Science Communications 32, pp. 85–93.
  2. Michael A. Harrison (1978): Introduction to formal language theory. Addison-Wesley Publishing Co., Reading, Mass..
  3. Jonathan Hoch & Adi Shamir (2006): Breaking the ICE -– Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions. In: Matthew Robshaw: Fast Software Encryption, Lecture Notes in Computer Science 4047. Springer Berlin / Heidelberg, pp. 179–194, doi:10.1007/11799313_12.
  4. Antoine Joux (2004): Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. In: Matt Franklin: Advances in Cryptology – CRYPTO 2004, Lecture Notes in Computer Science 3152. Springer Berlin / Heidelberg, pp. 99–213, doi:10.1007/978-3-540-28628-8_19.
  5. J. Kortelainen, T. Kortelainen & A. Vesanen (2011): Unavoidable regularities in long words with bounded number of symbol occurrences. Accepted to The 17th Annual International Computing and Combinatorics Conference (COCOON 2011).
  6. Juha Kortelainen, Kimmo Halunen & Tuomas Kortelainen (2010): Multicollision attacks and generalized iterated hash functions. J. Math. Cryptol. 4(3), pp. 239–270, doi:10.1515/JMC.2010.010.
  7. T. Kortelainen, J. Kortelainen & J. Halunen (2010): Variants of multicollision attacks on iterated hash functions. In: 6th China International Conference on Information Security and Cryptology (Inscrypt 2010), pp. 159–175.
  8. M. Lothaire (1997): Combinatorics on words. Cambridge Mathematical Library. Cambridge University Press, Cambridge, doi:10.1017/CBO9780511566097.
  9. Aldo de Luca & Stefano Varricchio (1999): Finiteness and regularity in semigroups and formal languages. Monographs in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin.
  10. Mridul Nandi & Douglas R. Stinson (2007): Multicollision attacks on some generalized sequential hash functions. IEEE Trans. Inform. Theory 53(2), pp. 759–767, doi:10.1109/TIT.2006.889721.
  11. A. Restivo (1977): Mots sans répétitions et langages rationnels bornés. RAIRO Informat. Théor. 11(3), pp. 197–202, iv.
  12. Antonio Restivo & Christophe Reutenauer (1983): Some applications of a theorem of Shirshov to language theory. Inform. and Control 57(2-3), pp. 205–213, doi:10.1016/S0019-9958(83)80044-8.
  13. Antonio Restivo & Christophe Reutenauer (1985): Rational languages and the Burnside problem. Theoret. Comput. Sci. 40(1), pp. 13–30, doi:10.1016/0304-3975(85)90156-2.
  14. Kazuhiro Suzuki, Dongvu Tonien, Kaoru Kurosawa & Koji Toyota (2006): Birthday paradox for multi-collisions. In: Information security and cryptology—ICISC 2006, Lecture Notes in Comput. Sci. 4296. Springer, Berlin, pp. 29–40, doi:10.1007/11927587_5.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org