Related papers: A Generic Approach to Searching for Jacobians

Groups of unknown order are of major interest due to their applications including time-lock puzzles, verifiable delay functions, and accumulators. In this paper we focus on trustless setup: in this setting, the most popular unknown-order…

Let $C/\mathbb{Q}$ be a genus $2$ curve whose Jacobian $J/\mathbb{Q}$ has real multiplication by a quadratic order in which $7$ splits. We describe an algorithm which outputs twists of the Klein quartic curve which parametrise elliptic…

We construct examples of families of curves of genus 2 or 3 over Q whose Jacobians split completely and have various large rational torsion subgroups. For example, the rational points on a certain elliptic surface over P^1 of positive rank…

We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based…

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 construct and study two series of curves whose Jacobians admit complex multiplication. The curves arise as quotients of Galois coverings of the projective line with Galois group metacyclic groups $G_{q,3}$ of order $3q$ with $q \equiv 1…

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…

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…

Here, we proposed an improved version of the deterministic random extractors $SEJ$ and $PEJ$ proposed by R. R. Farashahi in \cite{F} in 2009. By using the Mumford's representation of a reduced divisor $D$ of the Jacobian $J(\mathbb{F}_q)$…

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…

We study an explicit $(2g-1)$-dimensional family of Jacobian varieties of dimension $\frac{d-1}2(g-1)$, arising from quotient curves of unramified cyclic coverings of prime degree $d$ of hyperelliptic curves of genus $g\ge 2$. By using a…

This paper is devoted to constructing an explicit efficient representation for the Jacobian variety of a nonsingular curve of genus greater than 1, and its group law. We describe an algorithm for executing the group law on the Jacobian…

Let $C$ be a smooth plane quartic curve over $\mathbb{Q}$. Costa, Harvey and Sutherland provide an algorithm with an implementation, improving Harvey's average polynomial-time algorithm, to compute the $\bmod \ p$ reduction of the numerator…

In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single…

In general, algorithms for computing the Selmer group of the Jacobian of a curve have relied on either homogeneous spaces or functions on the curve. We present a theoretical analysis of algorithms which use functions on the curve, and show…

We present a heuristic algorithm to compute the ideal class group, and a generator of a principal ideal in $\mathbb{Q}(\zeta_{p^s})$ in time $2^{O(n^{1/2+\varepsilon})}$ for $n:= deg(K)$ and arbitrarily small $\varepsilon$. This yields an…

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…

This paper provides a probabilistic algorithm to determine generators of the m-torsion subgroup of the Jacobian of a hyperelliptic curve of genus two.

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…

We explore connections between the category of tropical abelian varieties (tav), $\mathbb{T}\mathcal{A}$, and the the category of tropical curves, $\mathbb{T}\mathcal{C}$, first in a broader context and then specifically by studying the…