Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
verfasst von : Phillip Rogaway, John Steinberger
Erschienen in: Advances in Cryptology – CRYPTO 2008
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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
.