Computations over finite fields, apart being of interest in their own right, have many applications in error-correcting codes (which usually are linear spaces over finite fields).

Also, there is a very tight relationship between algorithms for polynomial multiplication and error-correcting codes. Namely, each algorithm naturally transforms into a code and, conversely, good codes ``extend'' to fast algorithms.

In addition, all known algorithms for integer multiplications involve polynomial multiplication.

This talk is about the number of algebraic operations, mainly multiplications, involved in computing the coefficients of the product of two polynomials over a finite field.

Multiplications are counted because

  • they are much more complex than additions and
  • the number of additions usually depends on the number of multiplications.

Based on an upper bound on the minimal distance of some error-correcting codes, we establish a lower bound on the complexity of multiplication over finite fields.

The talk is self-contained and does not presume any acquaintance with complexity of algebraic computations or error-correcting codes.


Michael Kaminski

Research Area



Technion -- Israel Institute of Technology


Wed, 03/02/2016 - 1:30pm


RC-M032, Red Centre, UNSW