The XL-algorithm and a conjecture from commutative algebra

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

Volumn 3329, Issue , 2004, Pages 323-337

  Diem, Claus ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Algebraic attacks; Cryptanalysis; Extended linearization; Fr berg's Conjecture; Overdetermined systems of polynomial equations

Indexed keywords

ALGEBRA; COMPUTATION THEORY; CRYPTOGRAPHY; LINEARIZATION; POLYNOMIALS; SECURITY OF DATA;

ALGEBRAIC ATTACK; COMMUTATIVE ALGEBRA; CRYPTANALYSIS; EXPECTED RUNNING TIME; FINITE FIELDS; OVERDETERMINED SYSTEMS; POLYNOMIAL EQUATION; QUADRATIC EQUATIONS;

ALGORITHMS;

EID: 24944450905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30539-2_23     Document Type: Article

References (16)

1. M. Atiyah and I. Macdonald. Introduction to Commutative Algebra. Addison-Wesley, Reading, 1969.
2. 2. INRIA Rapport de recherche No. 5049, 2003.
3. J.-M. Chen and B.-Y. Yang. All in the XL Familiy: Theory and Practice. manuscript from June 2004.
4. J.-M. Chen and B.-Y. Yang. Theoretical Analysis of XL over Small Fields. In H. Wang, J. Pieprzyk, V. Varadharajan, editors, Information Security and Privacy, volume 3108 of LNCS, pages 277-288, Springer-Verlag, Berlin, 2004.
5. N. Courtois. Higher Order Correlation Attacks, XL algorithm, and Cryptanalysis of Toyocrypt. In P.J. Lee, C.H. Lim, editors, Advances in Cryptology -ICISC 02, volume 2587 of LNCS, pages 182-199, Springer-Verlag, Berlin, 2002.
6. N. Courtois, A. Klimov, J. Pararin, and A. Shamir. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, "extended version", available under http://www.minrank.org/xlfull.pdf (as of August 24, 2004).
7. N. Courtois, A. Klimov, J. Pararin, and A. Shamir. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. In B. Preneel, editor, Advances in Cryptology -EUROCRYPT 2000, volume 1807 of LNCS, pages 392-407. Springer-Verlag, Berlin, 2000.
8. N. Courtois and J. Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations. In Y. Zheng, editor, Advances in Cryptology -ASIACRYPT 2002, volume 2501 of LNCS, pages 267-287. Springer-Verlag, Berlin, 2002.
9. D. Eisenbud. Commutative Algebra with a View Toward Algebraic Geometry. Springer-Verlag, New York, 1995.
10. R. Fröberg. An inequality for Hubert series of graded algebras. Math. Scand., 56:117-144, 1985.
11. D. Knuth. The Art of Computer Programming. Addison-Wesley, Reading, 1973.
12. H. Matsumura. Commutative Ring Theory. Cambridge University Press, Cambridge, UK, 1986.
13. T. Moh. On the method of "XL" and its inefficiency to TTM. manuscript from January 28, 2000, available under http://eprint.iacr.org/2001/ 047.
14. S. Murphy and M.J.B. Robshaw. Essential algebraic structure within the AES. In M. Yung, editor, Advances in Cryptology -CRYPTO 2002, pages 1-16, 2002.
15. K. Pardue. Generic Sequences of Polynomials, manuscript from March 30, 2000.
16. G. Valla. Problems and Results on Hubert Polynomials of Graded Algebras. In J. Elas and J. Giral, editors, Six Lectures on Commutative Algebra, volume 166 of Progress in Mathematics. Birkhauser, Basel, 1996.