Cryptology ePrint Archive: Report 2006/485

Indifferentiability of Single-Block-Length and Rate-1 Compression Functions

Hidenori Kuwakado and Masakatu Morii

Abstract: The security notion of indifferentiability was proposed by Maurer, Renner, and Holenstein in 2004. In 2005, Coron, Dodis, Malinaud, and Puniya discussed the indifferentiability of hash functions. They showed that the Merkle-Damgaard construction is not secure in the sense of indifferentiability. In this paper, we analyze the security of single-block-length and rate-1 compression functions in the sense of indifferentiability. We formally show that all single-block-length and rate-1 compression functions, which include the Davies-Meyer compression function, are insecure. Furthermore, we show how to construct a secure single-block-length and rate-1 compression function in the sense of indifferentiability. This does not contradict our result above.

Category / Keywords: hash functions

Date: received 25 Dec 2006, last revised 7 Jan 2007

Contact author: kuwakado at kobe-u ac jp

Available format(s): PDF | BibTeX Citation

Note: - Correction: the definition of rate. This correction have no effect on our results. - Correction: typo

Version: 20070108:012431 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]