A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields: A lower bound on the complexity of polynomial multiplication over finite fields - Michael Kaminski (SIAM Journal on Computing, 2005)