Conference paper Open Access

On the Impact of Known-Key Attacks on Hash Functions

Mennink, Bart; Preneel, Bart

Hash functions are often constructed based on permutations or blockciphers, and security proofs are typically done in the ideal permutation or cipher model. However, once these random primitives are instantiated, vulnerabilities of these instantiations may nullify the security. At ASIACRYPT 2007, Knudsen and Rijmen introduced known-key security of blockciphers, which gave rise to many distinguishing attacks on existing blockcipher constructions. In this work, we analyze the impact of such attacks on primitive-based hash functions. We present and formalize the weak cipher model, which captures the case a blockcipher has a certain weakness but is perfectly random otherwise. A specific instance of this model, considering the existence of sets of B queries whose XOR equals 0 at bit-positions C, where C is an index set, covers a wide range of known-key attacks in literature. We apply this instance to the PGV compression functions, as well as to the Grøstl (based on two permutations) and Shrimpton-Stam (based on three permutations) compression functions, and show that these designs do not seriously succumb to any differential known-key attack known to date.

H2020 644052 / HECTOR
Files (753.6 kB)
Name Size
HECTOR-On-the-impact-of-known-key-attacks-2015.pdf
md5:07afb7ad4f8f9322f16f26907791cb54
753.6 kB Download
8
4
views
downloads
All versions This version
Views 88
Downloads 44
Data volume 3.0 MB3.0 MB
Unique views 88
Unique downloads 33

Share

Cite as