The equivariant complexity of multiplication in finite field extensions
Number Theory
2023-01-02 v2
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.
Keywords
Cite
@article{arxiv.2110.13763,
title = {The equivariant complexity of multiplication in finite field extensions},
author = {Jean-Marc Couveignes and Tony Ezome},
journal= {arXiv preprint arXiv:2110.13763},
year = {2023}
}