Related papers: The arithmetic of genus two curves
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 use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has $(n, n)$-split Jacobian. Based on such techniques, we observe that there are very few rational moduli…
The main purpose of this paper is to give an overview over the theory of abelian varieties, with main focus on Jacobian varieties of curves reaching from well-known results till to latest developments and their usage in cryptography. In the…
We compute the class of arithmetic genus two Teichmueller curves in the Picard group of pseudo-Hilbert modular surfaces, distinguished according to their torsion order and spin invariant. As an application, we compute the number of genus…
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 give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can…
We explicitly find an equation and a projective embedding of the Kummer surface associated to the Jacobian of a curve of genus 2 given by an equation of the form y^2 + h(x)y = f(x) over an arbitrary ground field as well as several maps that…
We compute explicit rational models for some Hilbert modular surfaces corresponding to square discriminants, by connecting them to moduli spaces of elliptic K3 surfaces. Since they parametrize decomposable principally polarized abelian…
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…
We study the problem of efficiently constructing a curve C of genus 2 over a finite field F for which either the curve C itself or its Jacobian has a prescribed number N of F-rational points. In the case of the Jacobian, we show that any…
A Teichm\"uller curve is an algebraic and isometric immersion of an algebraic curve into the moduli space of Riemann surfaces. We give the first explicit algebraic models of Teichm\"uller curves of positive genus. Our methods are based on…
We describe an algorithm, based on the properties of the characteristic polynomials of Frobenius, to compute $\operatorname{End}_{\overline{K}}(A)$ when $A$ is the Jacobian of a nice genus-2 curve over a number field $K$. We use this…
A set of multi-homogeneous equations for the Jacobian of a genus two curve is given. The approach used is to write down affine equations for the Jacobian minus various tranlations of the Theta-divisor by [2]-division points, and then to…
We find explicit equations for two-coverings of Jacobians of genus two curves over an arbitrary ground field of characteristic different from two.
Let $X$ (resp. $Y$) be a curve of genus 1 (resp. 2) over a base field $k$ whose characteristic does not equal 2. We give criteria for the existence of a curve $Z$ over $k$ whose Jacobian is up to twist (2,2,2)-isogenous to the products of…
This paper examines the arithmetic of the loci \(\cL_n\), parameterizing genus 2 curves with \((n, n)\)-split Jacobians over finite fields \(\F_q\). We compute rational points \(|\cL_n(\F_q)|\) over \(\F_3\), \(\F_9\), \(\F_{27}\),…
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…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
We give an algorithm to compute the conductor for curves of genus 2. It is based on the analysis of 3-torsion of the Jacobian for genus 2 curves over 2-adic fields.
We consider the problem of finding cryptographically suitable Jacobians. By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, we can search for Jacobians containing…