Cryptology ePrint Archive: Report 2008/071

Blockcipher Based Hashing Revisited

Martijn Stam

Abstract: We revisit the rate-1 blockcipher based hash functions as first studied by Preneel, Govaerts and Vandewalle (Crypto'93) and later extensively analysed by Black, Rogaway and Shrimpton (Crypto'02). We analyze a further generalization where any pre- and postprocessing is considered. By introducing a new tweak to earlier proof methods, we obtain a simpler proof that is both more general and more tight than existing results. As added benefit, this also leads to a clearer understanding of the current classification of rate-1 blockcipher based schemes as introduced by Preneel et al. and refined by Black et al.

Category / Keywords: secret-key cryptography /

Publication Info: Extended abstract to appear in FSE'09 proceedings

Date: received 14 Feb 2008, last revised 7 Apr 2009

Contact author: martijn stam at epfl ch

Available formats: PDF | BibTeX Citation

Version: 20090407:114759 (All versions of this report)

Discussion forum: Show discussion | Start new discussion