Explicit computation of isomorphisms between finite fields

DOI10.1006/ffta.2001.0344zbMath1058.11071OpenAlexW2095191510MaRDI QIDQ700165

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

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

Related Items (2)

Computational Number Theory, Past, Present, and Future ⋮ Computing isomorphisms and embeddings of finite fields

Uses Software

• NTL
• PARI/GP

Cites Work

• Unnamed Item
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Subquadratic-time factoring of polynomials over finite fields
• Fast construction of irreducible polynomials over finite fields

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