The equivariant complexity of multiplication in finite field extensions
arXiv:2110.13763
Abstract
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.