Building a collision-resistant compression function from non-compressing primitives

Building a collision-resistant compression function from non-compressing primitives (2008)

Cached

Download Links

[www.cs.pdx.edu]
[eprint.iacr.org]

Other Repositories/Bibliography

DBLP

by Thomas Shrimpton , Martijn Stam

Venue:	In ICALP 2008, Part II
Citations:	4 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Building a collision-resistant compression function from non-compressing primitives	INFERENCE
AUTHOR NAME	Thomas Shrimpton	SVM HeaderParse 0.2
AUTHOR AFFIL	1; University of Lugano and Portland State University	SVM HeaderParse 0.2
AUTHOR NAME	Martijn Stam	SVM HeaderParse 0.2
AUTHOR AFFIL	1; University of Lugano and Portland State University	SVM HeaderParse 0.2
ABSTRACT	Abstract. We consider how to build an efficient compression function from a small number of random, noncompressing primitives. Our main goal is to achieve a level of collision resistance as close as possible to the optimal birthday bound. We present a 2n-to-n bit compression function based on three independent n-to-n bit random functions, each called only once. We show that if the three random functions are treated as black boxes then finding collisions requires Θ(2 n/2 /n c) queries for c ≈ 1. This result remains valid if two of the three random functions are replaced by a fixed-key ideal cipher in Davies-Meyer mode (i.e., EK(x) ⊕ x for permutation EK). We also give a heuristic, backed by experimental results, suggesting that the security loss is at most four bits for block sizes up to 256 bits. We believe this is the best result to date on the matter of building a collision-resistant compression function from non-compressing functions. It also relates to an open question from Black et al. (Eurocrypt’05), who showed that compression functions that invoke a single non-compressing random function cannot suffice. We also explore the relationship of our problem with that of doubling the output of a hash function and we show how our compression function can be used to double the output length of ideal hashes.	SVM HeaderParse 0.2
YEAR	2008	INFERENCE
VENUE	In ICALP 2008, Part II	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	643--654	INFERENCE
CITATIONS	41 found	ParsCit 1.0