Cryptology ePrint Archive: Report 2005/152

On High-Rate Cryptographic Compression Functions

Richard Ostertag and Martin Stanek

Abstract: The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphers. We propose a model for high-rate compression functions, and give an upper bound for the rate of any collision resistant compression function in our model. In addition, we show that natural generalizations of constructions by Preneel, Govaerts, and Vandewalle to the case of rate-$2$ compression functions are not collision resistant.

Category / Keywords: hash functions

Date: received 18 May 2005

Contact author: stanek at dcs fmph uniba sk

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050526:045624 (All versions of this report)

Short URL: ia.cr/2005/152

Discussion forum: Show discussion | Start new discussion