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

Amir Averbuch; Nader H. Bshouty; Michael Kaminski

doi:10.1016/0196-6774(92)90057-J

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

School of Computer Science and AI

University of Calgary
Technion-Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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 language	English
Pages (from-to)	577-588
Number of pages	12
Journal	Journal of Algorithms
Volume	13
Issue number	4
DOIs	https://doi.org/10.1016/0196-6774(92)90057-J
State	Published - Dec 1992

Access to Document

10.1016/0196-6774(92)90057-J

Cite this

@article{4e316e2b9edc40f0b268a9f495283f64,

title = "A classification of algorithms for multiplying polynomials of small degree over finite fields",

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.",

author = "Amir Averbuch and Bshouty, \{Nader H.\} and Michael Kaminski",

year = "1992",

month = dec,

doi = "10.1016/0196-6774(92)90057-J",

language = "אנגלית",

volume = "13",

pages = "577--588",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "4",

}

TY - JOUR

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

AU - Averbuch, Amir

AU - Bshouty, Nader H.

AU - Kaminski, Michael

PY - 1992/12

Y1 - 1992/12

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/38249008693

U2 - 10.1016/0196-6774(92)90057-J

DO - 10.1016/0196-6774(92)90057-J

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249008693

SN - 0196-6774

VL - 13

SP - 577

EP - 588

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 4

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this