Fast Decomposition of Polynomials with Known Galois Group

DOI10.1007/3-540-44828-4_27zbMath1030.11078OpenAlexW1533018146MaRDI QIDQ4426704

François Morain, Andreas Enge

Publication date: 16 September 2003

Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44828-4_27

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Algebraic number theory computations (11Y40)

Related Items (7)

Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic ⋮ Explicit isogenies in quadratic time in any characteristic ⋮ Accelerating the CM method ⋮ Implementing the asymptotically fast version of the elliptic curve primality proving algorithm ⋮ Applications of Algebra for Some Game Theoretic Problems ⋮ Computing Igusa class polynomials ⋮ Computing Class Polynomials for Abelian Surfaces

Uses Software

• MPC

This page was built for publication: Fast Decomposition of Polynomials with Known Galois Group