On High-Rate Cryptographic Compression Functions

Authors

  • Richard Ostertág
  • Martin Stanek

Keywords:

Hash functions, compression functions, block ciphers, provable security

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.

Downloads

Download data is not yet available.

Downloads

Published

2012-01-27

How to Cite

Ostertág, R., & Stanek, M. (2012). On High-Rate Cryptographic Compression Functions. Computing and Informatics, 26(1), 77–87. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/301