Related papers: Computing cardinalities of Q-curve reductions over…

We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…

For a non-CM elliptic curve $E$ defined over a number field $K$, the Galois action on its torsion points gives rise to a Galois representation $\rho_E: Gal(\overline{K}/K)\to GL_2(\widehat{\mathbb{Z}})$ that is unique up to isomorphism. A…

We use the tropical geometry approach to compute absolute and relative Gromov-Witten invariants of complex surfaces which are $\CC P^1$-bundles over an elliptic curve. We also show that the tropical multiplicity used to count curves can be…

We investigate the low-lying zeros in families of $L$-functions attached to quadratic and cubic twists of elliptic curves defined over $\mathbb{F}_q(T)$. In particular, we present precise expressions for the expected values of traces of…

Let q be a power of a prime and E be an elliptic curve defined over F_q. In "Combinatorial aspects of elliptic curves" [17], the present author examined a sequence of polynomials which express the N_k's, the number of points on E over the…

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation…

Let $E/\mathbb{Q}$ be an elliptic curve with complex multiplication (CM), and for each prime $p$ of good reduction, let $a_E(p) = p + 1 - \#E(\mathbb{F}_p)$ denote the trace of Frobenius. By the Hasse bound, $a_E(p) = 2\sqrt{p} \cos…

We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.

Given an elliptic curve $E$ over a finite field $\mathbb{F}_q$ we study the finite extensions $\mathbb{F}_{q^n}$ of $\mathbb{F}_q$ such that the number of $\mathbb{F}_{q^n}$-rational points on $E$ attains the Hasse upper bound. We obtain an…

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 $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

The problem of computing an explicit isogeny between two given elliptic curves over F_q, originally motivated by point counting, has recently awaken new interest in the cryptology community thanks to the works of Teske and Rostovstev &…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Let $\ell$ and $p \geq 3$ be different primes. Let $E/\mathbb{Q}_\ell$ and $E'/\mathbb{Q}_\ell$ be elliptic curves with isomorphic $p$-torsion. Assume that $E$ has potentially multiplicative reduction. We classify when all…

Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…

Let $\E/\Q$ be a fixed elliptic curve over $\Q$ which does not have complex multiplication. Assuming the Generalized Riemann Hypothesis, A. C. Cojocaru and W. Duke have obtained an asymptotic formula for the number of primes $p\le x$ such…

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…

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups. We optimize low-level components such as reversible…

We address the problem of computing in the group of $\ell^k$-torsion rational points of the jacobian variety of algebraic curves over finite fields, with a view toward computing modular representations.