The equivariant complexity of multiplication in finite field extensions
Résumé
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.
Domaines
Théorie des nombres [math.NT]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
