3 citations · 3 across the 5 of their papers we have counts for
5 papers
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…
Practical improvements to class group and regulator computation of real quadratic fields
Jean-François Biasse, Jacobson John Michael
We present improvements to the index-calculus algorithm for the computation of the ideal class group and regulator of a real quadratic field. Our improvements consist of applying t…
Security Estimates for Quadratic Field Based Cryptosystems
Jean-François Biasse, Jacobson John Michael, Silverster K. Alan
We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic field. The a…