International audienceWe describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing an explicit treatment of the computations in quartic CM fields and their Galois closures, we pursue an approach due to Dupont for evaluating ϑ- constants in quasi-linear time using Newton iterations on the Borchardt mean. We report on experiments with our implementation and present an example with class number 20016
Abstract. We present a new method for constructing genus 2 curves over a finite field Fn with a give...
Let K be a quartic CM field, that is, a totally imaginary quadratic extension of a real quadratic nu...
International audienceWe present and analyze two algorithms for computing the Hilbert class polynomi...
We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 c...
The theory of complex multiplication makes it possible to construct certain class fields and abelian...
Abstract. We present a new method for computing the Igusa class polynomials of a primitive quartic C...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
International audienceWe propose to generalize the work of Régis Dupont for computing modular polyno...
To appear in Mathematics of Computation.International audienceWe analyse the complexity of computing...
International audienceBased on high precision computation of periods and lattice reduction technique...
International audienceSchoof's classic algorithm allows point-counting for elliptic curves over fini...
Abstract. For a complex abelian surface A with endomorphism ring isomorphic to the maximal order in ...
Existing algorithms to compute genus 2 theta constants in quasi-linear time use Borchardt sequences,...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
Abstract. We present a new method for constructing genus 2 curves over a finite field Fn with a give...
Let K be a quartic CM field, that is, a totally imaginary quadratic extension of a real quadratic nu...
International audienceWe present and analyze two algorithms for computing the Hilbert class polynomi...
We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 c...
The theory of complex multiplication makes it possible to construct certain class fields and abelian...
Abstract. We present a new method for computing the Igusa class polynomials of a primitive quartic C...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
International audienceWe propose to generalize the work of Régis Dupont for computing modular polyno...
To appear in Mathematics of Computation.International audienceWe analyse the complexity of computing...
International audienceBased on high precision computation of periods and lattice reduction technique...
International audienceSchoof's classic algorithm allows point-counting for elliptic curves over fini...
Abstract. For a complex abelian surface A with endomorphism ring isomorphic to the maximal order in ...
Existing algorithms to compute genus 2 theta constants in quasi-linear time use Borchardt sequences,...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
Abstract. We present a new method for constructing genus 2 curves over a finite field Fn with a give...
Let K be a quartic CM field, that is, a totally imaginary quadratic extension of a real quadratic nu...
International audienceWe present and analyze two algorithms for computing the Hilbert class polynomi...