A Classification of Quadratic Algorithms for Multiplying Polynomials of Small Degree Over Finite Fields
It is shown that any quadratic 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.
Unable to display preview. Download preview PDF.
- A. Karustsuba, Y. Ofman, Multiplication of Multidigit Numbers on Automata, Dokl. Akad. Nauk SSSR 145, (1962), 293–294 (in Russian).Google Scholar
- R. Lidl, H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, Vol. 20, G.-C. Rota, ed., Addison-Wesley, Reading, Massachusetts, 1983.Google Scholar
- A.L. Toom, The complexity of a scheme of functional elements realizing the multiplication of integers, Soviet Math. Docl. 4 (1963), 714–716.Google Scholar
- S. Winograd, Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field Constants, Math. System Theory 10 (1976/77), 169–180.Google Scholar