A CLASSIFICATION OF ALGORITHMS FOR MULTIPLYING POLYNOMIALS OF SMALL DEGREE OVER FINITE FIELDS

Date
1991-06-01
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Computer Science
Citation