Improvements in the computation of ideal class groups of imaginary quadratic number fields
Résumé
We investigate improvements to the algorithm for the computation of ideal class group 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 110-decimal digits discriminant ideal class group in less than a week.
Origine : Fichiers produits par l'(les) auteur(s)