1Department of Information Processing Science, University of Oulu, Finland.
2Secure Programming Group, Department of Electrical and Information Engineering, University of Oulu, Finland.
3Mathematics Division, Department of Electrical and Information Engineering, University of Oulu, Finland.
Citation Information:
Journal of Mathematical Cryptology.
Volume 4, Issue 3, Pages 239–270, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976,
DOI: 10.1515/jmc.2010.010,
October 2010
Publication History:
Received: 30/08/2009;
Revised: 10/06/2010;
Accepted: 06/09/2010;
Published Online: 28/02/2012
Abstract
We apply combinatorics on words to develop an approach to multicollisions in generalized iterated hash functions. Our work is based on the discoveries of A. Joux and on generalizations provided by M. Nandi and D. Stinson as well as J. Hoch and A. Shamir. We wish to unify the existing diverse notation in the field, bring basic facts together, reprove some previously published results and produce some new ones. A multicollision attack method informally described by Hoch and Shamir is laid on a sound statistical basis and studied in detail.
Comments (0)