Improved techniques for computing the ideal class group and a system of fundamental units in number fields

zbMATH Open1344.11088arXiv1204.1294MaRDI QIDQ2949488FDOQ2949488

Authors: Jean-François Biasse, Claus Fieker 

Publication date: 1 October 2015

Abstract: We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve algorithm to derive relations between elements of the ideal class group, and $p$-adic approximations to manage the loss of precision during the computation of units. This new algorithm is particularily efficient for number fields of small degree for which a speed-up of an order of magnitude is achieved with respect to the standard methods.

Full work available at URL: https://arxiv.org/abs/1204.1294

Recommendations

• Improvements in the computation of ideal class groups of imaginary quadratic number fields
• An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
• Subexponential class group and unit group computation in large degree number fields
• scientific article; zbMATH DE number 1302464
• Practical improvements to class group and regulator computation of real quadratic fields

zbMATH Keywords

unitsideal class groupnumber fieldsregulatorsubexponentialityindex calculus

Mathematics Subject Classification ID

Units and factorization (11R27) Class numbers, class groups, discriminants (11R29) Algebraic number theory computations (11Y40)

Cited In (9)

• Computing generators of the unit group of an integral Abelian group ring.
• Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
• Computing normal integral bases of abelian number fields
• Fast multiquadratic S-unit computation and application to the calculation of class groups
• An algorithm for solving the principal ideal problem with subfields
• Valuations of \(p\)-adic regulators of cyclic cubic fields
• Short generators without quantum computers: the case of multiquadratics
• Improved computation of polynomial roots over number fields when using complex embeddings
• Class field theory, Diophantine analysis and the asymptotic Fermat's last theorem

This page was built for publication: Improved techniques for computing the ideal class group and a system of fundamental units in number fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949488)