Related papers: Computing in Jacobians of projective curves over f…
We introduce an algorithm to compute the rational torsion subgroup of the Jacobian of a hyperelliptic curve of genus 3 over the rationals. We apply a Magma implementation of our algorithm to a database of curves with low discriminant due to…
In this note we investigate the connection between polylogarithms on curves and abelian schemes. The main result shows that the polylogarithm on the abelian scheme can be obtained as the push-forward of the polylogarithm on a suitable…
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 use methods for computing Picard numbers of reductions of K3 surfaces in order to study the decomposability of Jacobians over number fields and the variance of Mordell-Weil ranks of families of Jacobians over different ground fields. For…
We describe an algorithm that provably computes the rational torsion subgroup of the Jacobian of a curve without relying on height bounds. Instead, the strategy is to find upper bounds for the torsion subgroup using reduction modulo primes,…
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…
In this work, we present an efficient method for computing in the Generalized Jacobian of special singular curves. The efficiency of the operation is due to representation of an element in the Jacobian group by a single polynomial.
To every singular reduced projective curve X one can associate many fine compactified Jacobians, depending on the choice of a polarization on X, each of which yields a modular compactification of a disjoint union of the generalized Jacobian…
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…
The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
Let C be an arbitrary smooth algebraic curve of genus g over a large finite field K. We revisit fast addition algorithms in the Jacobian of C due to Khuri-Makdisi (math.NT/0409209, to appear in Math. Comp.). The algorithms, which reduce to…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
We study hyperbolic curves and their Jacobians over finite fields in the context of anabelian geometry.
There is a close relationship between the embedded topology of complex plane curves and the (group-theoretic) arithmetic of elliptic curves. In a recent paper, we studied the topology of some arrangements of curves which include a special…
Numerical tools for computation of $\wp$-functions, also known as Kleinian, or multiply periodic, are proposed. In this connection, computation of periods of the both first and second kinds is reconsidered. An analytical approach to…
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
We introduce and study polystable divisors on a tropical curve, which are the tropical analogue of polystable torsion-free rank-1 sheaves on a nodal curve. We construct a universal tropical Jacobian over the moduli space of tropical curves…
In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with…
We describe several improvements to algorithms for the rigorous computation of the endomorphism ring of the Jacobian of a curve defined over a number field.