MXL3: An efficient algorithm for computing Gröbner bases of zero-dimensional ideals

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

Volumn 5984 LNCS, Issue , 2010, Pages 87-100

  Mohamed, Mohamed Saied Emam ^a   Cabarcas, Daniel ^b   Ding, Jintai ^b   Buchmann, Johannes ^a   Bulygin, Stanislav ^c  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF CINCINNATI   (United States)

^c Center for Advanced Security Research   (Germany)

Author keywords

Gr bner basis; Multivariate polynomial systems; Mutant; MutantXL algorithm; XL algorithm

Indexed keywords

EFFICIENT ALGORITHM; MULTIVARIATE POLYNOMIAL; MULTIVARIATE POLYNOMIAL SYSTEMS; SUFFICIENT CONDITIONS; ZERO-DIMENSIONAL IDEAL;

ALGORITHMS; CRYPTOGRAPHY; MULTIVARIABLE SYSTEMS; POLYNOMIALS;

COMPUTATION THEORY;

EID: 77954565760     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14423-3_7     Document Type: Conference Paper

References (17)

1. Albrecht, M., Bard, G.: M4RI Linear Algebra over GF(2) (2008), http://m4ri.sagemath.org/index.html
2. Becker, T., Kredel, H., Weispfenning, V.: Gröbner bases: a computational approach to commutative algebra, April 1993. Springer, London (1993)
3. Brickenstein, M., Dreyer, A.: Polybori: A framework for gröbner-basis computations with boolean polynomials. Journal of Symbolic Computation 44(9), 1326-1345 (2009); Effective Methods in Algebraic Geometry
4. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal (An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal). PhD thesis, Mathematical Institute, University of Innsbruck, Austria, 1965 (English translation in Journal of Symbolic Computation (2004)
5. Buchberger, B.: A criterion for detecting unnecessary reductions in the construction of gröbner bases. Johannes Kepler University Linz, London, UK, vol. 72, pp. 3-21. Springer, Heidelberg (1979)
6. Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392-407. Springer, Heidelberg (2000)
7. Courtois, N.T.: Experimental Algebraic Cryptanalysis of Block Ciphers (2007), http://www.cryptosystem.net/aes/toyciphers.html
8. Ding, J.: Mutants and its impact on polynomial solving strategies and algorithms. Privately distributed research note, University of Cincinnati and Technical University of Darmstadt (2006)
9. Ding, J., Buchmann, J., Mohamed, M.S.E., Moahmed, W.S.A., Weinmann, R.-P.: MutantXL. In: Proceedings of the 1st international conference on Symbolic Computation and Cryptography (SCC 2008), Beijing, China, April 2008, pp. 16-22. LMIB (2008)
10. Ding, J., Carbarcas, D., Schmidt, D., Buchmann, J., Tohaneanu, S.: Mutant Gröbner Basis Algorithm. In: Proceedings of the 1st international conference on Symbolic Computation and Cryptography (SCC 2008), Beijing, China, April 2008, pp. 23-32. LMIB (2008)
11. Faugère, J.-C.: A new efficient algorithm for computing Gröbner bases (F4). Pure and Applied Algebra 139(1-3), 61-88 (1999)
12. Faugère, J.-C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In: Proceedings of the 2002 international symposium on Symbolic and algebraic computation (ISSAC), Lille, France, July 2002, pp. 75-83. ACM, New York (2002)
13. Faugère, J.-C., Ars, G.: Comparison of XL and Gröbner basis algorithms over Finite Fields. Research Report RR-5251, Institut National de Recherche en Informatique et en Automatique, INRIA (2004)
14. Faugère, J.-C., Joux, A.: Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44-60. Springer, Heidelberg (2003)
15. Mohamed, M.S.E., Ding, J., Buchmann, J., Werner, F.: Algebraic Attack on the MQQ Public Key Cryptosystem. In: Proceedings of the 8th International Conference on Cryptology And Network Security (CANS 2009), Kanazawa, Ishikawa, Japan, December 2009. LNCS, Springer, Heidelberg (to appear, 2009)
16. Mohamed, M.S.E., Mohamed, W.S.A.E., Ding, J., Buchmann, J.: MXL2: Solving Polynomial Equations over GF(2) using an Improved Mutant Strategy. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 203-215. Springer, Heidelberg (2008)
17. Sugita, M., Kawazoe, M., Imai, H.: Relation between the XL Algorithm and Gröbner Basis Algorithms. Transactions on Fundamentals of Electronics, Communications and Computer Sciences (IEICE) E89-A(1), 11-18 (2006)