2005 | OriginalPaper | Buchkapitel
A Failure-Friendly Design Principle for Hash Functions
verfasst von : Stefan Lucks
Erschienen in: Advances in Cryptology - ASIACRYPT 2005
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
This paper reconsiders the established Merkle-Damgård design principle for iterated hash functions. The internal state size
w
of an iterated
n
-bit hash function is treated as a security parameter of its own right. In a formal model, we show that increasing
w
quantifiably improves security against certain attacks, even if the compression function fails to be collision resistant. We propose the wide-pipe hash, internally using a
w
-bit compression function, and the double-pipe hash, with
w
=2
n
and an
n
-bit compression function used twice in parallel.