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

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.We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at [email protected]