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

Abstract : 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.
Document type :
Other publications
Complete list of metadatas

https://hal.inria.fr/inria-00397408
Contributor : Jean-François Biasse <>
Submitted on : Monday, June 22, 2009 - 9:43:38 AM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Long-term archiving on : Tuesday, June 15, 2010 - 6:09:26 PM

File

biasse.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00397408, version 1

Collections

Citation

Jean-François Biasse. Improvements in the computation of ideal class groups of imaginary quadratic number fields. 2009. ⟨inria-00397408⟩

Share

Metrics

Record views

504

Files downloads

430