13 citations · 27 across the 12 of their papers we have counts for
4 papers · 1 filter
Improvements in the computation of ideal class groups of imaginary quadratic number fields
Jean-François Biasse
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 p…
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
Jean-François Biasse, Claus Fieker
We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\OK$-module presented by Cohen, where $\OK$ is the ring of integers of a number field K…
New techniques for computing the ideal class group and a system of fundamental units in number fields
Jean-François Biasse, Claus Fieker
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 s…
An L(1/3) algorithm for discrete logarithm computation and principality testing in certain number fields
Jean-François Biasse
We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential com…