  We study the complexity of multiplication of two elements in a finite field
extension given by their coordinates in a normal basis. We show how to control
this complexity using the arithmetic and geometry of algebraic curves.
