Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

By Nicolas T. Courtois, Josef Pieprzyk. International Conference on the Theory and Application of Cryptology and Information Security, 2002

901 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/0baacd8464ad8499a33767ec2673f18bca39537e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

PRESENT: An Ultra-Lightweight Block Cipher (2007, methodology): “Some specialised techniques such as XL [10] and XSL [11] have been proposed , though flaws in both techniques have been discovered [8, 14].”
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication (2003, methodology): “R1 is clocked if and only if R4[10] agrees with the majority.”
Algebraic Attacks and Decomposition of Boolean Functions (2004, background): “In a different direction, in view of algebraic attacks on block ciphers, [7], it may be desirable to know for certain, e.”
Survey and benchmark of block ciphers for wireless sensor networks (2006, background): “It started with Courtois and Pieprzyk [40][41] presenting evidence that the security of Rijndael might not grow exponentially as intended with the number of rounds.”
The 128-Bit Blockcipher CLEFIA (Extended Abstract) (2007, methodology): “New design and evaluation techniques are evolved day by day; topics on algebraic immunity and related-key attacks are paid attention recently [6,8].”
Cube Attacks on Tweakable Black Box Polynomials (2009, methodology): “There are several improved algorithms such as XL and XSL (see [4],[5],[6], [7] and [8]) which reduce the number of required equations and the time and space complexities, but they are still completely impractical for such sizes.”
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications (2003, methodology): “Prior to the recent work of Courtois and Pieprzyk [5], the best (in terms of the number of rounds) known attack against Rijndael was a Φ k -restricted related key attack that uses 256 different related keys and that extends through nine (out of 14) rounds of Rijndael with 128-bit blocks and 256bit k”
Algebraic Attacks on Stream Ciphers with Linear Feedback (2003, methodology): “It turns out to be basically identical to the security criterion defined in Section 2 of [7] for multivariate trapdoor functions, and also to the requirements advocated in [9] for S-boxes of block ciphers.”