Computing isomorphisms and embeddings of finite fields

DOI10.1090/mcom/3363zbMath1408.13070arXiv1705.01221OpenAlexW2611888257MaRDI QIDQ4612574

Javad Doliskani, Ludovic Brieulle, Luca De Feo, Éric Schost, Jean-Pierre Flori

Publication date: 31 January 2019

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldscomplexity analysisembedding description problemembedding evaluation problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Related Items (3)

Fast computation of elliptic curve isogenies in characteristic two ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Estimating variances in time series kriging using convex optimization and empirical BLUPs

Uses Software

• FLINT
• Magma
• PARI/GP
• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular composition modulo triangular sets and applications
• Explicit computation of isomorphisms between finite fields
• Faster polynomial multiplication via multipoint Kronecker substitution
• Elliptic Gauss sums and applications to point counting
• On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
• Factoring integers with elliptic curves
• On fast multiplication of polynomials over arbitrary algebras
• Another polynomial homomorphism
• The Magma algebra system. I: The user language
• Lattices of compatibly embedded finite fields
• Counting points on elliptic curves over finite fields
• The distribution of the number of points modulo an integer on elliptic curves over finite fields
• Computing Frobenius maps and factoring polynomials
• Handbook of Finite Fields
• Taking roots over high extensions of finite fields
• Change of order for bivariate triangular sets
• Fast algorithms for l -adic towers over finite fields
• Fast Polynomial Factorization and Modular Composition
• Fast arithmetic for the algebraic closure of finite fields
• Powers of tensors and fast matrix multiplication
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Galois invariant smoothness basis
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• A p + 1 Method of Factoring
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Fast Algorithms for Manipulating Formal Power Series
• Normal bases via general Gauss periods
• Subquadratic-time factoring of polynomials over finite fields
• Normalbasis bei Körpern ohne höhere Verzweigung.
• Computing isomorphisms and embeddings of finite fields
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• Fast Library for Number Theory: An Introduction
• Fast construction of irreducible polynomials over finite fields
• Fast construction of irreducible polynomials over finite fields

This page was built for publication: Computing isomorphisms and embeddings of finite fields