The equivariant complexity of multiplication in finite field extensions

2021/10/26 by Couveignes, Jean-Marc, Ezome, Tony
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2110.13763

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.

Cited by

• Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields

Related

• On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation
• Chaining Multiplications in Finite Fields with Chudnovsky-type Algorithms and Tensor Rank of the k-multiplication
• Gaps between prime numbers and tensor rank of multiplication in finite fields
• Multiplication in finite fields with Chudnovsky-type algorithms on the projective line
• Multiplication in Cyclotomic Rings and its Application to Finite Fields