Sub-cubic change of ordering for Gröbner basis. A probabilistic approach

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2014, Pages 170-177

  Faugère, Jean Charles ^a   Gaudry, Pierrick ^b   Huot, Louise ^c   Renault, Guénaël ^c  

^a INRIA   (France)

^b CNRS   (France)

^c SORBONNE UNIVERSITÉ   (France)

Author keywords

Change of ordering; Gr bner basis; Polynomial systems

Indexed keywords

COMPUTATIONAL COMPLEXITY;

ARITHMETIC OPERATIONS; CHANGE OF ORDERING; CHANGE OF VARIABLES; DENSE MATRICES; LAS VEGAS ALGORITHMS; ORDERING ALGORITHMS; POLYNOMIAL SYSTEMS; PROBABILISTIC APPROACHES;

POLYNOMIALS;

EID: 84920019814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2608628.2608669     Document Type: Conference Paper

References (32)

1. M. Bardet, J.-C. Faugère, B. Salvy, and B. Yang. Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In P. Gianni, editor, The Effective Methods in Algebraic Geometry Conference, Mega 2005, pages 1 -14, May 2005.
2. D. Bayer and M. Stillman. A theorem on refining division orders by the reverse lexicographic order. Duke Mathematical Journal, 55(2):321-328, 1987.
3. E. Becker, T. Mora, M. G. Marinari, and C. Traverso. The shape of the shape lemma. In Proceedings of the international symposium on Symbolic and algebraic computation, ISSAC '94, pages 129-133, New York, NY, USA, 1994. ACM.
4. W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system. I. The user language. Journal of Symbolic Computation, 24(3-4):235-265, 1997.
5. A. Bostan, B. Salvy, and E. Schost. Fast algorithms for zero-dimensional polynomial systems using duality. Applicable Algebra in Engineering, Communication and Computing, 14(4):239-272, 2003.
6. J.-G. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard. LinBox: A generic library for exact linear algebra. In A. M. Cohen, X.-S. Gao, and N. Takayama, editors, ICMS'2002, Proceedings of the 2002 International Congress of Mathematical Software, Beijing, China, pages 40-50. World Scientific Pub., August 2002.
7. D. Eisenbud. Commutative Algebra with a View Toward Algebraic Geometry. Springer, 1995.
8. J.-C. Faugère, P. Gaudry, L. Huot, and G. Renault. Polynomial systems solving by fast linear algebra, 2013. http://arxiv.org/abs/1304.6039.
9. J.-C. Faugère. 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 '02, pages 75-83, New York, NY, USA, 2002. ACM.
10. J.-C. Faugère, P. Gaudry, L. Huot, and G. Renault. Using symmetries in the index calculus for elliptic curves discrete logarithm. Journal of Cryptology, pages 1-41, 2013. doi 10.1007/s00145-013-9158-5.
11. J.-C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional Gröbner bases by change of ordering. Journal of Symbolic Computation, 16(4):329-344, 1993.
12. J.-C. Faugère, L. Huot, A. Joux, G. Renault, and V. Vitse. Symmetrized summation polynomials: Using small order torsion points to speed up elliptic curve index calculus, 2014. To appear in the proceedings of the 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2014).
13. J.-C. Faugère and C. Mou. Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices. In ISSAC '11: Proceedings of the 2011 international symposium on Symbolic and algebraic computation, ISSAC '11, pages 1-8, New York, NY, USA, 2011. ACM.
14. J.-C. Faugère and C. Mou. Sparse FGLM algorithms. http://hal.inria.fr/hal-00807540, 2013.
15. A. Galligo. A Propos du Théorème de Préparation de Weierstrass. PhD thesis, Institut de Mathématique et Sciences Physiques de l'Université de Nice, 1973.
16. P. Gianni and T. Mora. Algebraic solution of systems of polynomial equations using Gröbner bases. In Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings of AAECC-5, volume 356 of LNCS, pages 247-257. Springer, 1989.
17. E. Jonckheere and C. Ma. A simple Hankel interpretation of the Berlekamp-Massey algorithm. Linear Algebra and its Applications, 125:65-76, 1989.
18. W. Keller-Gehrig. Fast algorithms for the characteristic polynomial. Theor. Comput. Sci., 36:309-317, June 1985.
19. Y. N. Lakshman. On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal. In Proceedings of the twenty-second annual ACM symposium on Theory of computing, STOC '90, pages 555-563, New York, NY, USA, 1990. ACM.
20. D. Lazard. Gröbner bases, gaussian elimination and resolution of systems of algebraic equations. In J. van Hulzen, editor, Computer Algebra, volume 162 of Lecture Notes in Computer Science, pages 146-156. Springer Berlin / Heidelberg, 1983.
21. J. Massey. Shift-register synthesis and bch decoding. Information Theory, IEEE Transactions on, 15(1):122-127, 1969.
22. G. Moreno-Socías. Degrevlex Gröbner bases of generic complete intersections. Journal of Pure and Applied Algebra, 180(3):263-283, 2003.
23. A. Morgan. Solving Polynominal Systems Using Continuation for Engineering and Scientific Problems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2009.
24. B. Mourrain and V. Y. Pan. Asymptotic acceleration of solving multivariate polynomial systems of equations. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 488-496. ACM, 1998.
25. H. Orman. The oakley key determination protocol, 1998.
26. K. Pardue. Nonstandard Borel-Fixed Ideals. PhD thesis, Brandeis University, 1994.
27. F. Rouillier. Solving zero-dimensional systems through the rational univariate representation. Applicable Algebra in Engineering, Communication and Computing, 9(5):433-461, 1999.
28. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4):701-717, Oct. 1980.
29. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13(4):354-356, 1969.
30. V. Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th symposium on Theory of Computing, pages 887-898. ACM, 2012.
31. D. H. Wiedemann. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theor., 32(1):54-62, 1986.
32. R. Zippel. Probabilistic algorithms for sparse polynomials. In E. Ng, editor, Symbolic and Algebraic Computation, volume 72 of Lecture Notes in Computer Science, pages 216-226. Springer Berlin Heidelberg, 1979.