National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Kombinatorika hashovacích funkcí
Sýkora, Jiří ; Holub, Štěpán (advisor) ; Šaroch, Jan (referee)
In this thesis, we study hash functions. We focus mainly on the famous Merkle-Damg˚ard construction and its generalisation. We show that even this generalised construction is not resistant to multicollision attacks. Combinatorics on words plays a fundamental role in the construction of our attack. We prove that regularities unavoidably appear in long words with bounded number of symbol occurences. We present our original results concerning regularities in long words. We lower some earlier published estimates, thus reducing the comlexity of the attack. Our results show that generalised iterated hash functions are interesting rather from the theoretical than practical point of view. 1

Interested in being notified about new results for this query?
Subscribe to the RSS feed.