Classification of some minimal quadratic algorithms for computing the coefficients of the product of two polynomials over finite field

Abstract

In this paper we will classify all the minimal quadratic algorithms for computing one bilinear form and for computing the coefficients of ( Σi =0 n xi λi )( Σi =0 n yi λi ) where n ≤ q where q − 2 is the number of elements of the field.

Cite this paper

@inproceedings{Bshouty2007ClassificationOS, title={Classification of some minimal quadratic algorithms for computing the coefficients of the product of two polynomials over finite field}, author={Nader H. Bshouty and Michael Kaminski and Amir Averbuch}, year={2007} }