Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Improved Collision Attack on the Hash Function Proposed at PKC’98
verfasst von : Florian Mendel, Norbert Pramstaller, Christian Rechberger
Erschienen in: Information Security and Cryptology – ICISC 2006
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
In this article, we present an improved collision attack on the hash function proposed by Shin
et al.
at PKC’98. The attack has a complexity of about 2
20.5
hash computations, while the previous attack of Chang
et al.
presented at SAC 2002 has a complexity of about 2
37.13
hash computations. In the analysis of the hash function we combined existing approaches with recent results in cryptanalysis of hash functions. We show that message-dependent rotations can be exploited to construct collisions. The weak design of the step function facilitates high-probability multi-block collisions.