Reducing number field defining polynomials: an application to class group computations

DOI10.1112/S1461157016000255zbMath1391.11163MaRDI QIDQ2971018

Alexandre Gélin, Antoine Joux

Publication date: 4 April 2017

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Other number fields (11R21) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29)

Related Items (1)

Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares

Cites Work

• Topics in computational algebraic number theory
• Factorization of certain cyclotomic functions
• Landau's inequality via Hadamard's
• An inequality for the discriminant of a polynomial
• Subexponential class group and unit group computation in large degree number fields
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• A polynomial reduction algorithm
• Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection

This page was built for publication: Reducing number field defining polynomials: an application to class group computations