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

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. Unknown where it was published
Keywords
hash functions
Contact author(s)
stanek @ dcs fmph uniba sk
History
2005-05-26: received
Short URL
https://ia.cr/2005/152
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/152,
      author = {Richard Ostertag and Martin Stanek},
      title = {On High-Rate Cryptographic Compression Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2005/152},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/152}},
      url = {https://eprint.iacr.org/2005/152}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.