Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Weimar-DM: A Highly Secure Double-Length Compression Function
verfasst von : Ewan Fleischmann, Christian Forler, Stefan Lucks, Jakob Wenzel
Erschienen in: Information Security and Privacy
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 present
Weimar-DM
, a double length compression function using two calls to a block cipher with 2
n
-bit key and
n
-bit block size to compress a 3
n
-bit string to a 2
n
-bit one. For
Weimar-DM
, we show that for
n
= 128, no adversary asking less than 2
n
− 1.77
= 2
126.23
queries can find a collision with probability greater than 1/2. This is the highest collision security bound ever shown for such a compression function. Even more important, our security analysis is much simpler than that for comparable functions as,
e.g.
,
Tandem-DM
,
Abreast-DM
or
Hirose-DM
. We also give a preimage security analysis of
Weimar-DM
showing a near-optimal bound of 2
2
n
− 5
= 2
251
queries. Our security bounds are asymptotically optimal.