Theoretical analysis of XL over small fields

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

Volumn 3108, Issue , 2004, Pages 277-288

  Yang, Bo Yin ^a   Chen, Jiun Ming ^b  

^a TAMKANG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Algebraic attack; Finite field; Multivariate glyptography; System of quadratic equations; XL

Indexed keywords

ALGEBRA; SECURITY OF DATA;

ALGEBRAIC ATTACK; FINITE FIELDS; MULTIVARIATE CRYPTOGRAPHY; QUADRATIC EQUATIONS; XL;

CRYPTOGRAPHY;

EID: 33646770907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27800-9_24     Document Type: Article

References (23)

1. M. Bardet, J.-C. Faugère, and B. Salvy, Complexity of Gröbner Basis Computations for Regular Overdetermined Systems, INRIA RR. No. 5049 and private communication.
2. J. R. Bunch and J. E. Hopcroft, Triangular Factorizations and Inversion by Fast Matrix Multiplication, Math. Computations, 24 (1974), pp. 231-236.
3. D. Bernstein, Matrix Inversion Made Difficult, preprint, stated to be superseded by a yet unpublished version, available at http : //cr. yp. to.
4. N. Courtois, The Security of Hidden Field Equations (HFE), CT-RSA 2001, LNCS v. 2020, pp. 266-281.
5. N. Courtois, Higher-Order Correlation Attacks, XLAlgorithm and Cryptanalysis of Toyocrypt, ICISC '02, LNCS v. 2587, pp. 182-199.
6. N. Courtois, Fast Algebraic Attacks on Stream Ciphers with Linear Feedback, CRYPTO'03, LNCS v. 2729, pp. 176-194.
7. v2, proc. PKC 2004, LNCS v. 2947, pp. 201-217.
8. N. Courtois, A. Klimov, J. Patarin, and A. Shamir, Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, EUROCRYPT 2000, LNCS V. 1807, pp. 392-407.
9. N. Courtois and J. Pieprzyk, Cryptanalysis of Block Ciphers with Overdefined Systems of Equations, ASIACRYPT 2002, LNCS v. 2501, pp. 267-287.
10. N. Courtois and J. Patarin, About the XL Algorithm over Gf(2), CT-RSA 2003, LNCS v. 2612, pp. 141-157.
11. I. S. Duff, A. M. Erismann, and J. K. Reid, Direct Methods for Sparse Matrices, published by Oxford Science Publications, 1986.
12. J.-C. Faugère, A New Efficient Algorithm for Computing Gröbner Bases without Reduction to Zero (F5), Proceedings of ISSAC 2002, pp. 75-83, ACM Press 2002.
13. J.-C. Faugère and A. Joux, Algebraic Cryptanalysis of Hidden Field Equations (HFE) Cryptosystems Using Gröbner Bases, CRYPTO 2003, LNCS v. 2729, pp. 44-60.
14. M. Garey and D. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, 1979, p. 251.
15. A. Kipnis and A. Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, CRYPTO'99, LNCS V. 1666, pp. 19-30.
16. T. Moh, On The Method of XL and Its Inefficiency Against TTM, available at http://eprint.iacr.org/2001/047
17. S. Murphy and M. Robshaw, Essential Algebraic Structures Within the AES, CRYPTO 2002, LNCS v. 2442, pp. 1-16.
18. J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, EUROCRYPT'96, LNCS v. 1070, pp. 33-48.
19. R. Stanley, Enumerative Combinatorics, vol. 1, second printing 1996;
20. R. Stanley, Enumerative Combinatorics, vol. 2 in 1999. Both published by Cambridge University Press, Cambridge.
21. V. Strassen, Gaussian Elimination is not Optimal, Numer. Math. 13 (1969) pp. 354-356.
22. B.-Y. Yang and J.-M. Chen, All in the XL Family: Theory and Practice, preprint.
23. B.-Y. Yang and J.-M. Chen, Asymptotic Behavior for XL and Friends, preprint.