Unavoidable regularities in long words with bounded number of symbol occurrences

DOI10.1007/s10878-012-9450-6zbMath1295.68178OpenAlexW2070457935MaRDI QIDQ386431

Tuomas Kortelainen, Juha Kortelainen, Ari Vesanen

Publication date: 9 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9450-6

zbMATH Keywords

permutationsgeneralized iterated hash functionsmulticollision attacksunavoidable regularities

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On highly palindromic words
• Rational languages and the Burnside problem
• Binary equality sets are generated by two words
• Multicollision attacks and generalized iterated hash functions
• INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE
• Multicollision Attacks on Some Generalized Sequential Hash Functions
• ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS
• Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
• The Ehrenfeucht-Silberger Problem
• Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård
• Some applications of a theorem of Shirshov to language theory
• Advances in Cryptology – CRYPTO 2004
• Constructing an Ideal Hash Function from Weak Ideal Compression Functions
• Local and global cyclicity in free semigroups

This page was built for publication: Unavoidable regularities in long words with bounded number of symbol occurrences