Explicit computation of isomorphisms between finite fields

DOI10.1006/FFTA.2001.0344MaRDI QIDQ700165zbMATHOpenAlexFDO

Authors Bill Allombert

Publication date 30 September 2002

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

Full work available at URL https://doi.org/10.1006/ffta.2001.0344

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Finding Isomorphisms Between Finite Fields
• On arithmetical algorithms over finite fields
• Computing isomorphisms and embeddings of finite fields
• scientific article; zbMATH DE number 4152523
• Arithmetic of finite fields

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• Fast construction of irreducible polynomials over finite fields
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Subquadratic-time factoring of polynomials over finite fields

Cited in

(7)

• Computing isomorphisms and embeddings of finite fields
• Fast arithmetic for the algebraic closure of finite fields
• Finding Isomorphisms Between Finite Fields
• Computational Number Theory, Past, Present, and Future
• On the hardness of the finite field isomorphism problem
• Isomorphisms of algebraic number fields
• Computing isomorphisms and embeddings of finite fields

Describes a project that uses

Uses Software

• NTL
• PARI/GP

This page was built for publication: Explicit computation of isomorphisms between finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700165)