Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions

Details Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions

2011-08-18

arxiv.org/abs/1108.3617v1

EPTCS 63, 2011, pp. 22-29

Computer Science

Formal Languages and Automata Theory

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.4

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.

Affiliated with

Also associated with

No associations

Rating

Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180559