Zero-sum distinguishers for iterated permutations and application to KECCAK-f and Hamsi-256

Authors:
Christina Boura;Anne Canteaut
Affiliations:
SECRET Project-Team, INRIA Paris-Rocquencourt, Le Chesnay Cedex, France and Gemalto, Meudon sur Seine, France;SECRET Project-Team, INRIA Paris-Rocquencourt, Le Chesnay Cedex, France
Venue:
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Year:
2010

Citing 11
Cited 4

A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters

Designs, Codes and Cryptography
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems

Designs, Codes and Cryptography
A Generalized Birthday Problem

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Degree of Composition of Highly Nonlinear Functions and Applications to Higher Order Differential Cryptanalysis

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
The Block Cipher Square

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Integral Cryptanalysis

FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Security Bounds for the Design of Code-Based Cryptosystems

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A new paradigm for collision-free hashing: incrementality at reduced cost

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Known-key distinguishers for some block ciphers

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Distinguishers for the compression function and output transformation of hamsi-256

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory

An improved algebraic attack on Hamsi-256

FSE'11 Proceedings of the 18th international conference on Fast software encryption
Higher-order differential properties of KECCAK and Luffa

FSE'11 Proceedings of the 18th international conference on Fast software encryption
Second-Order differential collisions for reduced SHA-256

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
New attacks on keccak-224 and keccak-256

FSE'12 Proceedings of the 19th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

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 219 and 210 for the finalization permutation in Hamsi-256.