Related papers: Computing low-degree isogenies in genus 2 with the…

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 present an algorithm solving the following problem: given two genus 2 curves over a field k with isogenous Jacobians, compute such an isogeny explicitly. This isogeny can be either an l-isogeny or, in the real multiplication case, an…

We give parametrisation of curves C of genus 2 with a maximal isotropic (ZZ/3)^2 in J[3], where J is the Jacobian variety of C, and develop the theory required to perform descent via (3,3)-isogeny. We apply this to several examples, where…

Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computing explicit rational representations of $(\ell,...,\ell)$-isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an…

We give an algorithm to compute $(\ell,\ell,\ell)$-isogenies from the Jacobians of genus three hyperelliptic curves to the Jacobians of non-hyperelliptic curves. An important application is to reduce the discrete logarithm problem in the…

In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians…

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 present a method for computing the Mordell-Weil rank of the jacobian of a curve of genus 2 with multiplication by a square root of 2, based on descent via isogenies of degree 2, and apply it to a family of curves.

Given a smooth non-hyperelliptic curve C of genus 3 and a maximal isotropic subgroup (w.r.t. the Weil pairing) L in Jac(C)[2], there exists a smooth curve C' s.t. Jac(C')=Jac(C)/L. This construction is symmetric. i.e. if we start with C'…

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…

Let $Y$ be a genus $2$ curve over $\mathbb Q$. We provide a method to systematically search for possible candidates of a prime $\ell\geq 3$ and a genus $1$ curve $X$ for which there exists a genus $3$ curve $Z$ over $\mathbb Q$ whose…

Fix a prime number $\ell$. Graphs of isogenies of degree a power of $\ell$ are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a…

Given a generic degree-2 cover of a genus 1 curve D by a non hyperelliptic genus 3 curve C over a field k of characteristic different from 2, we produce an explicit genus 2 curve X such that Jac(C) is isogenous to the product of Jac(D) and…

Let $K$ be a field of characteristic different from $2$, $\bar{K}$ its algebraic closure. Let $n \ge 3$ be an odd integer. Let $f(x)$ and $h(x)$ be degree $n$ polynomials with coefficients in $K$ and without repeated roots. Let us consider…

Suppose $X$ is a hyperelliptic curve of genus $g$ defined over an algebraically closed field $k$ of characteristic $p=2$. We prove that the de Rham cohomology of $X$ decomposes into pieces indexed by the branch points of the hyperelliptic…

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…

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.

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 describe an efficient algorithm for the computation of separable isogenies between abelian varieties represented in the coordinate system given by algebraic theta functions. Let $A$ be an abelian variety of dimension $g$ defined over a…

For any genus g greater than 1, we construct a family of dimension g+1 of pairs of hyperelliptic curves of genus g whose jacobian are 2^g isogeneous. ----- Pour tout genre g superieur ou egal a 2, nous construisons une famille a g+1…