Skip to Main content Skip to Navigation
Book sections

Cryptanalysis of block ciphers and weight divisibility of some binary codes

Abstract : The resistance of an iterated block cipher to most classical attacks can be quantified by some properties of its round function. The involved parameters (nonlinearity, degrees of the derivatives...) for a function F from GF(2^m) into GF(2^m) are related to the weight distribution of a binary linear code C_F of length (2^m − 1) and dimension 2m. In particular, the weight divisibility of C_F appears as an important criterion in the context of linear cryptanalysis and of higher-order differential attacks. When the round function F is a power permutation over GF(2^m), the associated code C_F is the dual of a primitive cyclic code with two zeroes. Therefore, McEliece's theorem provides a powerful tool for evaluating the resistance of some block ciphers to linear and higherorder differential attacks.
Document type :
Book sections
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download
Contributor : Marion Videau Connect in order to contact the contributor
Submitted on : Thursday, March 1, 2012 - 9:34:10 AM
Last modification on : Friday, January 21, 2022 - 3:17:44 AM
Long-term archiving on: : Thursday, May 31, 2012 - 2:20:51 AM


Files produced by the author(s)


  • HAL Id : hal-00675327, version 1



Anne Canteaut, Pascale Charpin, Marion Videau. Cryptanalysis of block ciphers and weight divisibility of some binary codes. Blaum, Mario and Farrell, Patrick G. and van Tilborg, Henk C.A. Information, coding, and mathematics: proceedings of the workshop honoring Prof. Bob McEliece on his 60th birthday, 687, Kluwer, pp.75-97, 2002, The Kluwer International Series in Engineering and Computer Science, 978-1-4020-7079-2. ⟨hal-00675327⟩



Les métriques sont temporairement indisponibles