HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The equivariant complexity of multiplication in finite field extensions

Jean-Marc Couveignes 1, 2, 3 Tony Ezome 4
1 UB - Université de Bordeaux
2 Bordeaux INP - Institut Polytechnique de Bordeaux
3 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
4 USTM - Université des Sciences et Techniques de Masuku [Franceville, Gabon]
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
https://hal.archives-ouvertes.fr/hal-03410146
Contributor : Jean-Marc Couveignes Connect in order to contact the contributor
Submitted on : Sunday, October 31, 2021 - 8:49:11 AM
Last modification on : Wednesday, February 2, 2022 - 3:54:45 PM
Long-term archiving on: : Tuesday, February 1, 2022 - 6:06:38 PM

File

Vignette du document
bnj.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03410146, version 1
  • ARXIV : 2110.13763

Collections

INSMI | AFRIQ | INRIA2 | INRIA | CNRS

Citation

Jean-Marc Couveignes, Tony Ezome. The equivariant complexity of multiplication in finite field extensions. 2021. ⟨hal-03410146⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

12

Files downloads

4

 

Contact                    Legal Notice                    Personal Data