On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
Journal of Cryptology, Volume 22, Issue 3, 2009, Pages 311-329.
Fix a small nonempty set of blockcipher keys . 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 . Although a few highly-efficient constructions have been proposed, no one has been able to prove their security. In ...More
PPT (Upload PPT)