Related papers: Computing class polynomials for abelian surfaces
Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…
We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…
We bound the running time of an algorithm that computes the genus-two class polynomials of a primitive quartic CM-field K. This is in fact the first running time bound and even the first proof of correctness of any algorithm that computes…
We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…
We propose to generalize the work of R\'egis Dupont for computing modular polynomials in dimension $2$ to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under…
We study quotients of principally polarized abelian varieties with real multiplication by Galois-stable finite subgroups and describe when these quotients are principally polarizable. We use this characterization to provide an algorithm to…
We present a quasi-linear algorithm to compute isogenies between Jacobians of curves of genus 2 and 3 starting from the equation of the curve and a maximal isotropic subgroup of the l-torsion, for l an odd prime number, generalizing the…
We give a complete answer to the question of which polynomials occur as the characteristic polynomials of Frobenius for genus-2 curves over finite fields.
We study the enumerative geometry of algebraic curves on abelian surfaces and threefolds. In the abelian surface case, the theory is parallel to the well-developed study of the reduced Gromov-Witten theory of K3 surfaces. We prove complete…
In this paper we prove an explicit formula for the arithmetic intersection number (CM(K).G1)_{\ell} on the Siegel moduli space of abelian surfaces, generalizing the work of Bruinier-Yang and Yang. These intersection numbers allow one to…
In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…
We present algorithms which, given a genus 2 curve $C$ defined over a finite field and a quartic CM field $K$, determine whether the endomorphism ring of the Jacobian $J$ of $C$ is the full ring of integers in $K$. In particular, we present…
Genus 2 curves have been an object of much mathematical interest since eighteenth century and continued interest to date. They have become an important tool in many algorithms in cryptographic applications, such as factoring large numbers,…
We give a method for finding rational equations of genus 2 curves whose jacobians are abelian varieties $A_f$ attached by Shimura to normalized newforms $f \in S_2( \Gamma_0(N))$. We present all the curves corresponding to principally…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
We extend our method to compute division polynomials of Jacobians of curves over Q to curves over Q(t), in view of computing mod ell Galois representations occurring in the \'etale cohomology of surfaces over Q. Although the division…
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…
We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…
In this paper we study genus 2 curves whose Jacobians admit a polarized (4,4)-isogeny to a product of elliptic curves. We consider base fields of characteristic different from 2 and 3, which we do not assume to be algebraically closed. We…
We show how to efficiently compute functions on jacobian varieties and their quotients. We deduce a quasi-optimal algorithm to compute $(l,l)$ isogenies between jacobians of genus two curves.