Blockcipher-Based Hashing Revisited

M Stam

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

54 Citations (Scopus)

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 analyse a further generalization where any pre- and postprocessing is considered. This 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. In addition, we also gain insight in chopped, overloaded and supercharged compression functions. In the latter category we propose two compression functions based on a single call to a blockcipher whose collision resistance exceeds the birthday bound on the cipher’s blocklength.
Translated title of the contributionBlockcipher-Based Hashing Revisited
Original languageEnglish
Title of host publicationFast Software Encryption - FSE 2009
PublisherSpringer Berlin Heidelberg
Pages67 - 83
Number of pages17
Volume5665
ISBN (Print)9783642033162
DOIs
Publication statusPublished - 2009

Bibliographical note

Conference Organiser: FSE 2009

Fingerprint Dive into the research topics of 'Blockcipher-Based Hashing Revisited'. Together they form a unique fingerprint.

Cite this