A new incremental algorithm for computing Groebner bases

In this paper, we present a new algorithm for computing Gröbner bases. Our algorithm is incremental in the same fashion as F5 and F5C. At a typical step, one is given a Gröbner basis G for an ideal I and any polynomial g, and it is desired to compute a Gröbner basis for the new ideal <<b>I, g>, obtained from I by joining g. Let (I: g) denote the colon ideal of I divided by g. Our algorithm computes Gröbner bases for <<b>I, g> and (I: g) simultaneously. In previous algorithms, S-polynomials that reduce to zero are useless, in fact, F5 tries to avoid such reductions as much as possible. In our algorithm, however, these "useless" S-polynomials give elements in (I: g) and are useful in speeding up the subsequent computations. Computer experiments on some benchmark examples indicate that our algorithm is much more efficient (two to ten times faster) than F5 and F5C.

[1]  J. Faugère.  A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[2]  Jean Charles Faugère,et al.  A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.

[3]  Adi Shamir,et al.  Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.

[4]  Yao Sun,et al.  A New Proof of the F5 Algorithm , 2010, ArXiv.

[5]  Bruno Buchberger,et al.  A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.

[6]  Martin Kreuzer,et al.  Computing border bases , 2006 .

[7]  Christian Eder,et al.  F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases , 2009, J. Symb. Comput..

[8]  Jintai Ding,et al.  MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy , 2008, PQCrypto.

[9]  Jintai Ding,et al.  MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals , 2009, ICISC.

[10]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[11]  F. S. Macaulay.  Some Formulæ in Elimination , 1902 .

[12]  N. Bose.  Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory , 1995 .

[13]  Jintai Ding,et al.  Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over F2 , 2010, AFRICACRYPT.

[14]  Daniel Lazard,et al.  Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations , 1983, EUROCAL.

[15]  Antoine Joux,et al.  A Variant of the F4 Algorithm , 2011, CT-RSA.