### 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.

##### Metadata
Available format(s)
Category
Secret-key cryptography
Publication info
Published elsewhere. Extended abstract to appear in FSE'09 proceedings
Contact author(s)
martijn stam @ epfl ch
History
2009-04-07: revised
2008-02-18: received
See all versions
Short URL
https://ia.cr/2008/071
License

CC BY

BibTeX

@misc{cryptoeprint:2008/071,
author = {Martijn Stam},
title = {Blockcipher Based Hashing Revisited},
howpublished = {Cryptology ePrint Archive, Paper 2008/071},
year = {2008},
note = {\url{https://eprint.iacr.org/2008/071}},
url = {https://eprint.iacr.org/2008/071}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.