Related papers: Computing with necklaces on elliptic curves

We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…

We define and count lattice points in the moduli space of stable genus g curves with n labeled points. This extends a construction of the second author for the uncompactified moduli space. The enumeration produces polynomials with top…

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…

Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…

Let $E$ be an elliptic curve over $\mathbb{Q}$. In this paper we study two certain modular curves which parameterize families of elliptic curves which are directly (resp. reverse) 6-congruent to $E$ together with the explicit…

Let $E/\mathbb{Q}$ be an elliptic curve. For a prime $p$ of good reduction, let $r(E,p)$ be the smallest non-negative integer that gives the $x$-coordinate of a point of maximal order in the group $E(\mathbb{F}_p)$. We prove unconditionally…

In this paper we address two different problems related with the factorization of an RSA module N. First we can show that factoring is equivalent in deterministic polynomial time to counting points on a pair of twisted Elliptic curves…

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

For a prime number $p$, we study the asymptotic distribution of CM points on the moduli space of elliptic curves over $\mathbb{C}_p$. In stark contrast to the complex case, in the $p$-adic setting there are infinitely many different…

We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…

We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.

In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-\varepsilon$,…

A prime number $p$ is said to be irregular if it divides the class number of the $p$-th cyclotomic field $\mathbb{Q}(\zeta_{p}) = \mathbb{Q}(\mathbb{G}_m[p])$. In this paper, we study its elliptic analogue for the division fields of an…

We look into computational aspects of two classical knot invariants. We look for ways of simplifying the computation of the coloring invariant and of the Alexander module. We support our ideas with explicit computations on pretzel knots.

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

We extend the explicit quadratic Chabauty methods developed in previous work by the first two authors to the case of non-hyperelliptic curves. This results in an algorithm to compute the rational points on a curve of genus $g \ge 2$ over…

An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.

A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields.…

An elliptic curve may be immersed in ${\mathbf{P}}^{N-1}$ as a degree $N$ curve using level $N$ structure. In the case where $N$ is odd, there are well known classical results dating back to Bianchi and Klein. In this paper we study the…