The equivariant complexity of multiplication in finite field extensions

DOI10.1016/j.jalgebra.2023.01.022OpenAlexW3209417921MaRDI QIDQ2693365

Jean-Marc Couveignes, Tony Ezome

Publication date: 20 March 2023

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.13763

zbMATH Keywords

complexityfinite fieldsnormal basesalgebraic curvesJacobians

Mathematics Subject Classification ID

Theory of computing (68Qxx) Curves in algebraic geometry (14Hxx) Computational number theory (11Yxx)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Optimal normal bases in \(GF(p^ n)\)
• On fast multiplication of polynomials over arbitrary algebras
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• Counting points on elliptic curves over finite fields
• Elliptic periods for finite fields
• Fast multiplication of large numbers
• Handbook of Finite Fields
• Modern Computer Algebra
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• Some bilinear forms whose multiplicative complexity depends on the field of constants
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: The equivariant complexity of multiplication in finite field extensions