Improvements in the computation of ideal class groups of imaginary quadratic number fields

DOI10.3934/AMC.2010.4.141zbMATH Open1257.11108arXiv1204.1300OpenAlexW2962719645MaRDI QIDQ540359FDOQ540359

Jean-François Biasse

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: We investigate improvements to the algorithm for the computation of ideal class groups described by Jacobson in the imaginary quadratic case. These improvements rely on the large prime strategy and a new method for performing the linear algebra phase. We achieve a significant speed-up and are able to compute ideal class groups with discriminants of 110 decimal digits in less than a week.

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

Recommendations

• Practical improvements to class group and regulator computation of real quadratic fields
• Applying sieving to the computation of quadratic class groups
• Subexponential algorithms for class group and unit computations
• scientific article; zbMATH DE number 4200333
• Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
• scientific article; zbMATH DE number 1113844
• Computation of Relative Class Numbers of Imaginary Abelian Number Fields
• On ideal class group computation of imaginary multiquadratic fields
• scientific article; zbMATH DE number 16712
• scientific article; zbMATH DE number 1643955

zbMATH Keywords

Hermite normal formideal class groupindex calculusdouble large prime variantstructured Gaussian elimination

Mathematics Subject Classification ID

Quadratic extensions (11R11) Class numbers, class groups, discriminants (11R29) Algebraic number theory computations (11Y40)

Cited In (9)

• Computing points of bounded height in projective space over a number field
• A proof of the conjectured run time of the Hafner-McCurley class group algorithm
• Fast multiquadratic S-unit computation and application to the calculation of class groups
• Quadratic sieving
• On class group computations using the number field sieve
• A $p$-adic algorithm to compute the Hilbert class polynomial
• Improved algorithm for the isogeny problem for ordinary elliptic curves
• I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
• Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields

This page was built for publication: Improvements in the computation of ideal class groups of imaginary quadratic number fields

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