Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
verfasst von : Christina Boura, Anne Canteaut
Erschienen in: Selected Areas in Cryptography
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
The zero-sum distinguishers introduced by Aumasson and Meier are investigated. First, the minimal size of a zero-sum is established. Then, we analyze the impacts of the linear and the nonlinear layers in an iterated permutation on the construction of zero-sum partitions. Finally, these techniques are applied to the
Keccak
-
f
permutation and to Hamsi-256. We exhibit several zero-sum partitions for 20 rounds (out of 24) of
Keccak
-
f
and some zero-sum partitions of size 2
19
and 2
10
for the finalization permutation in Hamsi-256.