Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256

Christina Boura; Anne Canteaut

Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256

Christina Boura ^{1, 2} Anne Canteaut ¹

1 SECRET - Security, Cryptology and Transmissions

Inria Paris-Rocquencourt

Abstract : 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.

Keywords : Hash functions integral properties zero-sums SHA-3

Document type :

Conference papers

Domain :

Computer Science [cs] / Cryptography and Security [cs.CR]

Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00738200
Contributor : Christina Boura <>
Submitted on : Wednesday, October 3, 2012 - 4:36:45 PM
Last modification on : Wednesday, December 19, 2018 - 1:08:13 PM
Document(s) archivé(s) le : Friday, January 4, 2013 - 3:58:47 AM

boura_canteaut_sac10.pdf

Publisher files allowed on an open archive

Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256

File

Identifiers

Collections

Citation

Export

Metrics

226

289

Contact

Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256

File

Identifiers

Collections

Citation

Export

Share

Metrics

226

289

Contact