A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields

Abstract It is shown that any optimal algorithm for computing the product of two degree- n polynomials over the q -element field, where n ≤ q , is based on the Chinese Remainder Theorem, with linear and quadratic polynomials presented as the moduli.

[1]  D. V. Chudnovsky,et al.  Algebraic complexities and algebraic curves over finite fields , 1987, J. Complex..

[2]  Allan Borodin,et al.  Fast Modular Transforms via Division , 1972, SWAT.

[3]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[4]  Amir Averbuch,et al.  Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algeabra G[u] / < Q(u)^l >, l > 1 , 1988, Theor. Comput. Sci..

[5]  Ephraim Feig.  Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic , 1983, J. Algorithms.

[6]  Nader H. Bshouty,et al.  Multiplicative complexity of polynomial multiplication over finite fields , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7]  Nader H. Bshouty,et al.  Multiplication of Polynomials over Finite Fields , 1990, SIAM J. Comput..

[8]  Rudolf Lide,et al.  Finite fields , 1983 .

[9]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[10]  Ephraim Feig.  On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear , 1981, J. Algorithms.

[11]  Abraham Lempel,et al.  On the Complexity of Multiplication in Finite Fields , 1983, Theor. Comput. Sci..

[12]  Amir Averbuch,et al.  Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial , 1986, ICALP.