[Resource Topic] 2007/223: On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions

Welcome to the resource topic for 2007/223

On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions

Authors: John Black, Martin Cochran, Thomas Shrimpton


Fix a small, non-empty set of blockcipher keys 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 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 is not correct under an instantiation suggested for this construction, nor can TCH be correctly instantiated by any other efficient means.

ePrint: https://eprint.iacr.org/2007/223

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .