Advertisement
Published in:
2008 | OriginalPaper | Chapter
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
Authors : Phillip Rogaway, John Steinberger
Published in: Advances in Cryptology – CRYPTO 2008
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions have security approaching and in many cases equaling the security upper bounds found in previous work of the authors [24]. In particular, we describe a 2
n
-bit to
n
-bit compression function using three
n
-bit permutation calls that has collision security
N
0.5
, where
N
= 2
n
, and we describe 3
n
-bit to 2
n
-bit compression functions using five and six permutation calls and having collision security of at least
N
0.55
and
N
0.63
.