arXiv · 2110.13763
The equivariant complexity of multiplication in finite field extensions
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.
Explore related subjects
Keep this discovery
Jean-Marc Couveignes, Tony Ezome. 2021-10-26. The equivariant complexity of multiplication in finite field extensions. https://arxiv.org/abs/2110.13763
Cite the original work for its findings. Save a collection to share your selection of sources.