论文信息 - An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants

An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants

Abstract We present an algorithm for computing the coefficients of the product of two polynomials of degree n over the ring of integers in O(n log n) multiplications. This algorithm relies on the Chinese Remainder Theorem, with powers of cyclotomic polynomials presented as the moduli. The algorithm can be implemented over any ring and its implementation does not depend on the ring constants.

Michael Kaminski

[1] David P. Dobkin,et al. An Improved Lower Bound on Polynomial Multiplication , 1980, IEEE Transactions on Computers.

[2] Yechezkel Zalcstein,et al. Algebras Having Linear Multiplicative Complexities , 1977, JACM.

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

[4] Michael Kaminski. Mulltiplication of Polynomials over the Ring of Integers , 1984, FOCS.

[5] H. Nussbaumer,et al. Fast polynomial transform algorithms for digital convolution , 1980 .

[6] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

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

[8] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.

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

[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[11] Tom M. Apostol,et al. Resultants of cyclotomic polynomials , 1970 .

[12] P. Bateman. The distribution of values of the Euler function , 1972 .

[13] Cyclotomic polynomials and units in cyclotomic number fields , 1988 .

[14] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .

[15] Michael Kaminski. Note on probabilistic algorithms in integer and polynomial arithmetic , 1981, SYMSAC '81.