On the complexity of multiplication in finite fields

AbstractIn this paper we study the bilinear complexity of multiplying two arbitrary elements from an nth degree extension Φ of a finite field F, and the related problem of multiplying, over F, two polynomials of degree n − 1 with indeterminate coefficients. We derive a new linear lower bound, and we describe an algorithm leading to a quasi-linear upper bound