Efficient Multivariate Factorization over Finite Fields

We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4.

[1]  Stephen R. Czapor,et al.  Solving Algebraic Equations: Combining Buchberger's Algorithm with Multivariate Factorization , 1989, J. Symb. Comput..

[2]  D. Cantor,et al.  A new algorithm for factoring polynomials over finite fields , 1981 .

[3]  Erich Kaltofen,et al.  Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators , 1990, J. Symb. Comput..

[4]  Michael B. Monagan.  Gauss: A Parameterized Domain of Computation System with Support for Signature Functions , 1993, DISCO.

[5]  H. Popp.  Moduli Theory and Classification Theory of Algebraic Varieties , 1977 .

[6]  Erich Kaltofen,et al.  Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7]  N. S. Barnett,et al.  Private communication , 1969 .

[8]  Richard D. Jenks,et al.  AXIOM: the scientific computation system , 1992 .

[9]  Erich Kaltofen.  Sparse Hensel Lifting , 1985, European Conference on Computer Algebra.

[10]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[11]  K. M. Heal,et al.  Maple V: Learning Guide , 1995 .

[12]  Laurent Bernardin.  Factorization of multivariate polynomials over finite fields , 1999 .

[13]  Erich Kaltofen,et al.  Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields , 1983, ICALP.

[14]  Victor Shoup,et al.  A New Polynomial Factorization Algorithm and its Implementation , 1995, J. Symb. Comput..

[15]  J. von zur Gathen.  Factoring sparse multivariate polynomials , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[16]  Erich Kaltofen,et al.  A generalized class of polynomials that are hard to factor , 1981, SYMSAC '81.

[17]  Joachim von zur Gathen,et al.  Irreducibility of Multivariate Polynomials , 1985, J. Comput. Syst. Sci..

[18]  Michael Lucks.  A fast implementation of polynomial factorization , 1986, SYMSAC '86.

[19]  Michael B. Monagan.  In-place Arithmetic for Polinominals over Zn , 1992, DISCO.

[20]  Michael Monagan,et al.  In-place Arithmetic for Polynomials over Zn , 1993 .

[21]  Laurent Bernardin.  On Square-Free Factorization of Multivariate Polynomials over a Finite Field , 1997, Theor. Comput. Sci..