On the Collision and Preimage Resistance of Certain Two-Call Hash Functions

Bagheri, Nasour, Gauravaram, Praveen, Naderi, Majid, & Thomsen, Søren S. (2010) On the Collision and Preimage Resistance of Certain Two-Call Hash Functions. In Cryptology and Network Security. Springer, Berlin, pp. 96-105.

View at publisher

Abstract

In this paper we present concrete collision and preimage attacks on a large class of compression function constructions making two calls to the underlying ideal primitives. The complexity of the collision attack is above the theoretical lower bound for constructions of this type, but below the birthday complexity; the complexity of the preimage attack, however, is equal to the theoretical lower bound.

We also present undesirable properties of some of Stam’s compression functions proposed at CRYPTO ’08. We show that when one of the n-bit to n-bit components of the proposed 2n-bit to n-bit compression function is replaced by a fixed-key cipher in the Davies-Meyer mode, the complexity of finding a preimage would be 2 n/3. We also show that the complexity of finding a collision in a variant of the 3n-bits to 2n-bits scheme with its output truncated to 3n/2 bits is 2 n/2. The complexity of our preimage attack on this hash function is about 2 n . Finally, we present a collision attack on a variant of the proposed m + s-bit to s-bit scheme, truncated to s − 1 bits, with a complexity of O(1). However, none of our results compromise Stam’s security claims.

Impact and interest:

0 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 81634
Item Type: Book Chapter
Keywords: cryptographic hash functions, information-theoretic security, permutation-based hash functions
DOI: 10.1007/978-3-642-17619-7_8
ISBN: 978-3-642-17619-7
ISSN: 1611-3349
Divisions: Current > QUT Faculties and Divisions > Division of Administrative Services
Current > Schools > School of Exercise & Nutrition Sciences
Copyright Owner: Copyright 2010 Springer
Deposited On: 05 Feb 2015 04:04
Last Modified: 30 Oct 2015 16:07

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page