Elliptic periods for finite fields

DOI10.1016/j.ffa.2008.07.004zbMath1216.11106arXiv0802.0165OpenAlexW2028633248MaRDI QIDQ2517811

Jean-Marc Couveignes, Reynald Lercier

Publication date: 9 January 2009

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

complexityelliptic curvesnormal basis

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (19)

Fast computation of elliptic curve isogenies in characteristic two ⋮ Fast operations on linearized polynomials and their applications in coding theory ⋮ Normal bases from 1-dimensional algebraic groups ⋮ Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology ⋮ On decoding high-order interleaved sum-rank-metric codes ⋮ The equivariant complexity of multiplication in finite field extensions ⋮ Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm ⋮ On finite field arithmetic in characteristic 2 ⋮ On modular inverses of cyclotomic polynomials and the magnitude of their coefficients ⋮ Elliptic periods and primality proving ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field ⋮ Construction of self-dual normal bases and their complexity ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ Modular polynomials on Hilbert surfaces ⋮ Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic ⋮ Rank-Metric Codes and Their Applications ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity ⋮ Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
• Low complexity normal bases
• On the complexity of the dual basis of a type I optimal normal basis
• The trace of an optimal normal element and low complexity normal bases
• Optimal normal bases in \(GF(p^ n)\)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• On fast multiplication of polynomials over arbitrary algebras
• Optimal normal bases
• Fast multiplication of polynomials over fields of characteristic 2
• Algorithms for exponentiation in finite fields
• On the bilinear complexity of the multiplication in small finite fields
• Fast multiplication of large numbers
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• ON THE PROBLEM OF JACOBSTHAL
• Computing special powers in finite fields
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: Elliptic periods for finite fields