2011 | OriginalPaper | Buchkapitel
Practical Analysis of Reduced-Round Keccak
verfasst von : María Naya-Plasencia, Andrea Röck, Willi Meier
Erschienen in: Progress in Cryptology – INDOCRYPT 2011
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
Keccak
is a finalist of the SHA-3 competition. In this paper we propose a practical distinguisher on 4 rounds of the hash function with the submission parameters. Recently, the designers of
Keccak
published several challenges on reduced versions of the hash function. With regard to this, we propose a preimage attack on 2 rounds, a collision attack on 2 rounds and a near collision on 3 rounds of
$\lfloor$
Keccak
$\rfloor_{224}$
and
$\lfloor$
Keccak
$\rfloor_{256}$
. These are the first practical cryptanalysis results on reduced rounds of the hash function scenario. All of our results have been implemented.