Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

  • Nicolas T. Courtois
  • Josef Pieprzyk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2501)


Several recently proposed ciphers, for example Rijndael and Serpent, are built with layers of small S-boxes interconnected by linear key-dependent layers. Their security relies on the fact, that the classical methods of cryptanalysis (e.g. linear or differential attacks) are based on probabilistic characteristics, which makes their security grow exponentially with the number of rounds N r r.

In this paper we study the security of such ciphers under an additional hypothesis: the S-box can be described by an overdefined system of algebraic equations (true with probability 1). We show that this is true for both Serpent (due to a small size of S-boxes) and Rijndael (due to unexpected algebraic properties). We study general methods known for solving overdefined systems of equations, such as XL from Eurocrypt’00, and show their inefficiency. Then we introduce a new method called XSL that uses the sparsity of the equations and their specific structure.

The XSL attack uses only relations true with probability 1, and thus the security does not have to grow exponentially in the number of rounds. XSL has a parameter P, and from our estimations is seems that P should be a constant or grow very slowly with the number of rounds. The XSL attack would then be polynomial (or subexponential) in N r> , with a huge constant that is double-exponential in the size of the S-box. The exact complexity of such attacks is not known due to the redundant equations. Though the presented version of the XSL attack always gives always more than the exhaustive search for Rijndael, it seems to (marginally) break 256-bit Serpent. We suggest a new criterion for design of S-boxes in block ciphers: they should not be describable by a system of polynomial equations that is too small or too overdefined.

Key Words

Block ciphers AES Rijndael Square Serpent Camellia multivariate quadratic equations MQ problem overdefined systems of multivariate equations XL algorithm Gröbner bases sparse multivariate polynomials Multivariate Cryptanalysis 


  1. 1.
    Ross Anderson, Eli Biham and Lars Knudsen: Serpent: A Proposal for the Advanced Encryption Standard. Available from
  2. 2.
    Anne Canteaut, Marion Videau: Degree of composition of highly nonlinear functions and applications to higher order differential cryptanalysis; Eurocrypt 2002, LNCS 2332, Springer.CrossRefGoogle Scholar
  3. 3.
    Don Coppersmith, Shmuel Winograd: “Matrix multiplication via arithmetic progressions”; J. Symbolic Computation (1990), 9, pp. 251–280.zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Joan Daemen, Vincent Rijmen: AES proposal: Rijndael; The latest revised version of the proposal is available on the internet,
  5. 5.
    Nicolas Courtois, Louis Goubin, Willi Meier, Jean-Daniel Tacier: Solving Underdefined Systems of Multivariate Quadratic Equations; PKC 2002, LNCS 2254, Springer, pp. 211–225.Google Scholar
  6. 6.
    Nicolas Courtois: The security of Hidden Field Equations (HFE); Cryptographers’ Track Rsa Conference 2001, San Francisco 8–12 April 2001, LNCS 2020, Springer-Verlag, pp. 266–281.CrossRefGoogle Scholar
  7. 7.
    Horst Feistel: Cryptography and computer privacy; Scientific American, vol. 228, No. 5, pp. 15–23, May 1973.CrossRefGoogle Scholar
  8. 8.
    Niels Ferguson, Richard Schroeppel and Doug Whiting: A simple algebraic representation of Rijndael; SAC’01, page 103, LNCS 2259, Springer.Google Scholar
  9. 9.
    Niels Ferguson, John Kelsey, Stefan Lucks, Bruce Schneier, Mike Stay, David Wagner, Doug Whiting: Improved Cryptanalysis of Rijndael, FSE 2000, Springer.Google Scholar
  10. 10.
    J.B. Kam and G.I. Davida: Structured design of substitution-permutation encryption networks; IEEE Trans. on Computers, Vol. C-28, 1979, pp. 747–753.MathSciNetCrossRefGoogle Scholar
  11. 11.
    Lars R. Knudsen, Vincent Rijmen: On the Decorrelated Fast Cipher (DFC) and its Theory; FSE’99, Springer, LNCS 1636, pp. 81–94.Google Scholar
  12. 12.
    Michael Luby, Charles W. Rackoff, How to construct pseudorandom permutations from pseudorandom functions; SIAM Journal on Computing, vol. 17, n. 2, pp. 373–386, April 1988.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    T.T. Moh: On The Method of XL and Its Inefficiency Against TTM, available at
  14. 14.
    S. Murphy, M. Robshaw: Essential Algebraic Structure within the AES, Crypto 2002, Springer.Google Scholar
  15. 15.
    Moni Naor and Omer Reingold: On the construction of pseudo-random permutations: Luby-Rackoff revisited; Journal of Cryptology, vol 12, 1999, pp. 29–66.zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Kaisa Nyberg: Differentially Uniform Mappings for Cryptography; Eurocrypt’93, LNCS 765, Springer, pp. 55–64.Google Scholar
  17. 17.
    Jacques Patarin: Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88; Crypto’95, Springer-Verlag, pp. 248–261.Google Scholar
  18. 18.
    Jacques Patarin: Generic Attacks on Feistel Schemes; Asiacrypt 2001, LNCS 2248, Springer, pp. 222–238.CrossRefGoogle Scholar
  19. 19.
    Jacques Patarin: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms; in Eurocrypt’96, Springer Verlag, pp. 33–48.Google Scholar
  20. 20.
    Jacques Patarin, Nicolas Courtois, Louis Goubin: Improved Algorithms for Isomorphism of Polynomials; Eurocrypt 1998, Springer-Verlag.Google Scholar
  21. 21.
    Adi Shamir, Alex Biryukov: Structural Cryptanalysis of SASAS; Eurocrypt 2001, LNCS 2045, Springer, pp. 394–405.Google Scholar
  22. 22.
    Adi Shamir, Aviad Kipnis: Cryptanalysis of the HFE Public Key Cryptosystem; In Advances in Cryptology, Proceedings of Crypto’99, Springer-Verlag, LNCS.Google Scholar
  23. 23.
    Adi Shamir, Jacques Patarin, Nicolas Courtois, Alexander Klimov, Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations, Eurocrypt’2000, LNCS 1807, Springer, pp. 392–407.Google Scholar
  24. 24.
    Robert D. Silverman: A Cost-Based Security Analysis of Symmetric and Asymmetric Key Lengths; RSA Lab. report,
  25. 25.
    Claude Elwood Shannon: Communication theory of secrecy systems; Bell System Technical Journal 28 (1949), see in patricular page 704.Google Scholar
  26. 26.
    Serge Vaudenay: Provable Security for Block Ciphers by Decorrelation; Technical Report LIENS-98-8, ENS, France, available at
  27. 27.
    Serge Vaudenay, Shiho Moriai: On the Pseudorandomness of Top-Level Schemes of Block Ciphers; Asiacrypt 2000, LNCS 1976, Springer, pp. 289–302.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Nicolas T. Courtois
    • 1
  • Josef Pieprzyk
    • 2
  1. 1.CP8 Crypto Lab, SchlumbergerSemaLouveciennes CedexFrance
  2. 2.Center for Advanced Computing - Algorithms and Cryptography, Department of ComputingMacquarie UniversitySydneyAustralia

Personalised recommendations