On High-Rate Cryptographic Compression Functions
Keywords:Hash functions, compression functions, block ciphers, provable security
AbstractThe 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.
Download data is not yet available.
How to Cite
Ostertág, R., & Stanek, M. (2012). On High-Rate Cryptographic Compression Functions. COMPUTING AND INFORMATICS, 26(1), 77–87. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/301