A classification of algorithms for multiplying polynomials of small degree over finite fields

Amir Averbuch*, Nader H. Bshouty, Michael Kaminski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)577-588
Number of pages12
JournalJournal of Algorithms
Volume13
Issue number4
DOIs
StatePublished - Dec 1992

Fingerprint

Dive into the research topics of 'A classification of algorithms for multiplying polynomials of small degree over finite fields'. Together they form a unique fingerprint.

Cite this