Abstract
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.
Partially written when visiting the Department of Computing, Macquarie University in Sydney, Australia.
Chapter PDF
Similar content being viewed by others
Key Words
References
Ross Anderson, Eli Biham and Lars Knudsen: Serpent: A Proposal for the Advanced Encryption Standard. Available from http://www.cl.cam.ac.uk/~rja14/serpent.html
Anne Canteaut, Marion Videau: Degree of composition of highly nonlinear functions and applications to higher order differential cryptanalysis; Eurocrypt 2002, LNCS 2332, Springer.
Don Coppersmith, Shmuel Winograd: “Matrix multiplication via arithmetic progressions”; J. Symbolic Computation (1990), 9, pp. 251–280.
Joan Daemen, Vincent Rijmen: AES proposal: Rijndael; The latest revised version of the proposal is available on the internet, http://csrc.nist.gov/encryption/aes/rijndael/Rijndael.pdf
Nicolas Courtois, Louis Goubin, Willi Meier, Jean-Daniel Tacier: Solving Underdefined Systems of Multivariate Quadratic Equations; PKC 2002, LNCS 2254, Springer, pp. 211–225.
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.
Horst Feistel: Cryptography and computer privacy; Scientific American, vol. 228, No. 5, pp. 15–23, May 1973.
Niels Ferguson, Richard Schroeppel and Doug Whiting: A simple algebraic representation of Rijndael; SAC’01, page 103, LNCS 2259, Springer.
Niels Ferguson, John Kelsey, Stefan Lucks, Bruce Schneier, Mike Stay, David Wagner, Doug Whiting: Improved Cryptanalysis of Rijndael, FSE 2000, Springer.
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.
Lars R. Knudsen, Vincent Rijmen: On the Decorrelated Fast Cipher (DFC) and its Theory; FSE’99, Springer, LNCS 1636, pp. 81–94.
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.
T.T. Moh: On The Method of XL and Its Inefficiency Against TTM, available at http://eprint.iacr.org/2001/047/.
S. Murphy, M. Robshaw: Essential Algebraic Structure within the AES, Crypto 2002, Springer.
Moni Naor and Omer Reingold: On the construction of pseudo-random permutations: Luby-Rackoff revisited; Journal of Cryptology, vol 12, 1999, pp. 29–66.
Kaisa Nyberg: Differentially Uniform Mappings for Cryptography; Eurocrypt’93, LNCS 765, Springer, pp. 55–64.
Jacques Patarin: Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88; Crypto’95, Springer-Verlag, pp. 248–261.
Jacques Patarin: Generic Attacks on Feistel Schemes; Asiacrypt 2001, LNCS 2248, Springer, pp. 222–238.
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.
Jacques Patarin, Nicolas Courtois, Louis Goubin: Improved Algorithms for Isomorphism of Polynomials; Eurocrypt 1998, Springer-Verlag.
Adi Shamir, Alex Biryukov: Structural Cryptanalysis of SASAS; Eurocrypt 2001, LNCS 2045, Springer, pp. 394–405.
Adi Shamir, Aviad Kipnis: Cryptanalysis of the HFE Public Key Cryptosystem; In Advances in Cryptology, Proceedings of Crypto’99, Springer-Verlag, LNCS.
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.
Robert D. Silverman: A Cost-Based Security Analysis of Symmetric and Asymmetric Key Lengths; RSA Lab. report, http://www.rsasecurity.com/rsalabs/bulletins/bulletin13.html.
Claude Elwood Shannon: Communication theory of secrecy systems; Bell System Technical Journal 28 (1949), see in patricular page 704.
Serge Vaudenay: Provable Security for Block Ciphers by Decorrelation; Technical Report LIENS-98-8, ENS, France, available at http://lasecwww.epfl.ch/query.msql?ref=Vau98b.
Serge Vaudenay, Shiho Moriai: On the Pseudorandomness of Top-Level Schemes of Block Ciphers; Asiacrypt 2000, LNCS 1976, Springer, pp. 289–302.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courtois, N.T., Pieprzyk, J. (2002). Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive