Cryptanalysis of block ciphers with overdefined systems of equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2501, Issue , 2002, Pages 267-287

  Courtois, Nicolas T ^a   Pieprzyk, Josef ^b  

^a CP8 Crypto Lab   (France)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

AES; Block ciphers; Camellia; Gr obner bases; MQ problem; Multivariate cryptanalysis; Multivariate quadratic equations; Overdefined systems of multivariate equations; Rijndael; Serpent; Sparse multivariate polynomials; Square; XL algorithm

Indexed keywords

ALGEBRA; LYAPUNOV METHODS; POLYNOMIALS; SECURITY OF DATA;

BLOCK CIPHERS; CAMELLIA; MQ PROBLEM; MULTIVARIATE CRYPTANALYSIS; MULTIVARIATE EQUATIONS; MULTIVARIATE POLYNOMIAL; MULTIVARIATE QUADRATIC EQUATIONS; RIJNDAEL; SERPENT; SQUARE;

CRYPTOGRAPHY;

EID: 84958765510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36178-2_17     Document Type: Conference Paper

References (27)

1. 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
2. Anne Canteaut, Marion Videau: Degree of composition of highly nonlinear functions and applications to higher order differential cryptanalysis; Eurocrypt 2002, LNCS 2332, Springer.
3. Don Coppersmith, Shmuel Winograd: “Matrix multiplication via arithmetic progressions”; J. Symbolic Computation (1990), 9, pp. 251-280.
4. 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
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.
6. Nicolas Courtois: The security of Hidden Field Equations (HFE); Cryptographers’ Track Rsa Conference 2001, San Francisco 8-12 April 2001, LNCS2020, Springer-Verlag, pp. 266-281.
7. Horst Feistel: Cryptography and computer privacy; Scientific American, vol. 228, No. 5, pp. 15-23, May 1973.
8. Niels Ferguson, Richard Schroeppel and Doug Whiting: A simple algebraic representation of Rijndael; SAC’01, page 103, LNCS 2259, Springer.
9. Niels Ferguson, John Kelsey, Stefan Lucks, Bruce Schneier, Mike Stay, David Wagner, Doug Whiting: Improved Cryptanalysis of Rijndael, FSE 2000, Springer.
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.
11. Lars R. Knudsen, Vincent Rijmen: On the Decorrelated Fast Cipher (DFC) and its Theory; FSE’99, Springer, LNCS 1636, pp. 81-94.
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.
13. T.T. Moh: On The Method of XL and Its Inefficiency Against TTM, available at http://eprint.iacr.org/2001/047/.
14. S. Murphy, M. Robshaw: Essential Algebraic Structure within the AES, Crypto 2002, Springer.
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.
16. Kaisa Nyberg: Differentially Uniform Mappings for Cryptography; Eurocrypt’93, LNCS 765, Springer, pp. 55-64.
17. Jacques Patarin: Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88; Crypto’95, Springer-Verlag, pp. 248-261.
18. Jacques Patarin: Generic Attacks on Feistel Schemes; Asiacrypt 2001, LNCS 2248, Springer, pp. 222-238.
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.
20. Jacques Patarin, Nicolas Courtois, Louis Goubin: Improved Algorithms for Isomorphism of Polynomials; Eurocrypt 1998, Springer-Verlag.
21. Adi Shamir, Alex Biryukov: Structural Cryptanalysis of SASAS; Eurocrypt 2001, LNCS 2045, Springer, pp. 394-405.
22. Adi Shamir, Aviad Kipnis: Cryptanalysis of the HFE Public Key Cryptosystem; In Advances in Cryptology, Proceedings of Crypto’99, Springer-Verlag, LNCS.
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.
24. Robert D. Silverman: A Cost-Based Security Analysis of Symmetric and Asymmetric Key Lengths; RSA Lab. report, www.rsasecurity.com/rsalabs/bulletins/bulletin13.html.
25. Claude Elwood Shannon: Communication theory of secrecy systems;, Bell System Technical Journal 28 (1949), see in patricular page 704.
26. 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.
27. Serge Vaudenay, Shiho Moriai: On the Pseudorandomness of Top-Level Schemes of Block Ciphers; Asiacrypt 2000, LNCS 1976, Springer, pp. 289-302.