Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
verfasst von : John Black, Martin Cochran, Thomas Shrimpton
Erschienen in: Advances in Cryptology – EUROCRYPT 2005
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Fix a small, non-empty set of blockcipher keys
${\mathcal K}$
. We say a blockcipher-based hash function is
highly-efficient
if it makes exactly one blockcipher call for each message block hashed, and all blockcipher calls use a key from
${\mathcal K}$
. Although a few highly-efficient constructions have been proposed, no one has been able to prove their security. In this paper we prove, in the ideal-cipher model, that it is
impossible
to construct a highly-efficient iterated blockcipher-based hash function that is provably secure. Our result implies, in particular, that the Tweakable Chain Hash (TCH) construction suggested by Liskov, Rivest, and Wagner [7] is
not
correct under an instantiation suggested for this construction, nor can TCH be correctly instantiated by any other efficient means.