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.

Keywords

Cite this article

@article{cai-1552,
  author  = {Richard Ostertág and Martin Stanek},
  title   = {On High-Rate Cryptographic Compression Functions},
  journal = {Computing and Informatics},
  volume  = {26},
  number  = {1},
  pages   = {77--87},
  year    = {2007},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2007/1/on-high-rate-cryptographic-compression-functions/}
}
Download .bib