Multiplication of Polynomials over Finite Fields
Nader H. Bshouty, Michael Kaminski · SIAM Journal on Computing · 1990
The authors prove the $2.5 n - o(n)$ lower bound on the number of multiplications/divisions required to compute the coefficients of the product of two polynomials of degree n over a finite field by means of straight-line algorithms.