Improvements in the computation of ideal class groups of imaginary quadratic number fields
Number Theory
2012-04-06 v1 Symbolic Computation
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.
Keywords
Cite
@article{arxiv.1204.1300,
title = {Improvements in the computation of ideal class groups of imaginary quadratic number fields},
author = {Jean-François Biasse},
journal= {arXiv preprint arXiv:1204.1300},
year = {2012}
}
Comments
14 pages, 5 figures