Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions
Formal Languages and Automata Theory
2011-08-19 v1
Abstract
Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet. In this paper we take another viewpoint and focus on combinatorial properties of long words in which the number of occurrences of any symbol is restritced by a fixed constant. We then demonstrate the connection of these properties to constructing multicollision attacks on so called generalized iterated hash functions.
Keywords
Cite
@article{arxiv.1108.3617,
title = {Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions},
author = {Juha Kortelainen},
journal= {arXiv preprint arXiv:1108.3617},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412