Efficient arithmetic in successive algebraic extension fields using symmetries
type: Item
instance of: scholarly article
title: Efficient arithmetic in successive algebraic extension fields using symmetries
zbMATH Open document ID: 1300.12006
author: Sébastien Orange
author: Guénaël Renault
author: Kazuhiro Yokoyama
published in: Mathematics in Computer Science
publication date: 2013-04-24T00:00:00Z
review text: In this article, the authors present new results for efficient arithmetic operations in a number field \(K\) represented by successive extensions. The results are based on multi-modular and evaluation-interpolation techniques. They also show how to use intrinsic symmetries in order to increase the efficiency of these techniques and present applications to splitting fields of univariate polynomials. The paper lists 22 references.
reviewed by: Vilmar Trevisan
Mathematics Subject Classification ID: 12F10
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6157175
zbMATH Keywords: algorithms
zbMATH Keywords: arithmetic
zbMATH Keywords: algebraic extension field
zbMATH Keywords: splitting field
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: s11786-012-0112-y
OpenAlex ID: W2064110670
cites work: Computation of the decomposition group of a triangular ideal
cites work: Q4714013
cites work: Using Galois ideals for computing relative resolvents
cites work: The Magma algebra system. I: The user language
cites work: Homotopy techniques for multiplication modulo triangular sets
cites work: Q3139838
cites work: Sharp estimates for triangular sets
cites work: Dynamic Galois theory
cites work: Construction de corps de décomposition grace aux facteurs de résolvantes
cites work: Galois group computation for rational polynomials
cites work: Q3973340
cites work: Q4038758
cites work: Q4673157
cites work: Fast arithmetic for triangular sets: from theory to practice
cites work: Computation schemes for splitting fields of polynomials
cites work: Q4692759
cites work: Algorithmic Number Theory
cites work: Calcul de résolvantes avec les modules de Cauchy
cites work: A modular method for computing the Galois groups of polynomials
DOI: 10.1007/S11786-012-0112-Y
description: scientific article; zbMATH DE number 6157175