arXiv Analytics

Sign in

arXiv:2110.13763 [math.NT]AbstractReferencesReviewsResources

The equivariant complexity of multiplication in finite field extensions

Jean-Marc Couveignes, Tony Ezome

Published 2021-10-26, updated 2022-12-30Version 2

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.

Related articles: Most relevant | Search more
arXiv:1506.01371 [math.NT] (Published 2015-06-03)
Algebraic curves uniformized by congruence subgroups of triangle groups
arXiv:1807.09927 [math.NT] (Published 2018-07-26)
Normal bases and irreducible polynomials
arXiv:1801.06388 [math.NT] (Published 2018-01-19)
A note on multivariable $(\varphi,Γ)$-modules