CRYPTO '89 Proceedings on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Finiteness and Regularity in Semigroups and Formal Languages
Finiteness and Regularity in Semigroups and Formal Languages
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Birthday Paradox for Multi-Collisions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Multi-collision attack on the compression functions of MD4 and 3-pass HAVAL
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Second preimage attacks on dithered hash functions
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Linear-XOR and additive checksums don't protect Damgård-Merkle hashes from generic attacks
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Herding hash functions and the nostradamus attack
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Multicollision Attacks on Some Generalized Sequential Hash Functions
IEEE Transactions on Information Theory
Unavoidable regularities in long words with bounded number of symbol occurrences
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Multicollisions and graph-based hash functions
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Unavoidable regularities in long words with bounded number of symbol occurrences
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We develop a word combinatorial approach to multi-collisions in generalized iterated hash functions. The work rests on the notable discoveries of A. Joux and on generalizations provided by M. Nandi and D. Stinson as well as J. Hoch and A. Shamir. New results and improvements to some previously published ones are produced. We also wish to unify the diverse notations and bring the results together by applying concepts of combinatorics on words. A multicollision attack method informally described by Hoch and Shamir is presented as a statistical procedure and analyzed in detail.