Efficient arithmetic in successive algebraic extension fields using symmetries

DOI10.1007/s11786-012-0112-yzbMath1300.12006OpenAlexW2064110670MaRDI QIDQ1948674

Kazuhiro Yokoyama, Sébastien Orange, Guénaël Renault

Publication date: 24 April 2013

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-012-0112-y

zbMATH Keywords

algorithmsarithmeticsplitting fieldalgebraic extension field

Mathematics Subject Classification ID

Related Items (1)

Usage of modular techniques for efficient computation of ideal operations

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic Galois theory
• Homotopy techniques for multiplication modulo triangular sets
• Fast arithmetic for triangular sets: from theory to practice
• A modular method for computing the Galois groups of polynomials
• The Magma algebra system. I: The user language
• Computation of the decomposition group of a triangular ideal
• Computation schemes for splitting fields of polynomials
• Sharp estimates for triangular sets
• Construction de corps de décomposition grace aux facteurs de résolvantes
• Calcul de résolvantes avec les modules de Cauchy
• Algorithmic Number Theory
• Using Galois ideals for computing relative resolvents
• Galois group computation for rational polynomials

This page was built for publication: Efficient arithmetic in successive algebraic extension fields using symmetries