Elliptic periods for finite fields

Abstract

We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Basis in the second family, the so-called normal elliptic basis are normal basis and allow fast (quasi linear) arithmetic. We prove that all extensions admit models of this kind.

Cited by in corpus (9)

• Residues of skew rational functions
• Construction of self-dual normal bases and their complexity
• On Decoding High-Order Interleaved Sum-Rank-Metric Codes
• On Modular Inverses of Cyclotomic Polynomials and the Magnitude of their Coefficients
• On Elkies subgroups of l-torsion points in elliptic curves defined over a finite field
• Decoding High-Order Interleaved Rank-Metric Codes
• Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants
• Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
• On finite field arithmetic in characteristic $2$