Related papers: Counting points on hyperelliptic curves with expli…
In recent algorithms that use deformation in order to compute the number of points on varieties over a finite field, certain differential equations of matrices over p-adic fields emerge. We present a novel strategy to solve this kind of…
In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve and is thus not a generic algorithm. The…
In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…
We present a Kedlaya-style point counting algorithm for cyclic covers $y^r = f(x)$ over a finite field $\mathbb{F}_{p^n}$ with $p$ not dividing $r$, and $r$ and $\deg{f}$ not necessarily coprime. This algorithm generalizes the…
In this article, we present a method for computing rational points on hyperelliptic curves of genus~3 and isolated quadratic points on hyperelliptic curves of genus~2 and~3 whose Jacobians have rank~0. Our approach begins by computing the…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$. In this article, we classify all groups that can arise as $E(\mathbb{Q}(\zeta_p))_{\text{tors}}$ up to isomorphism for any prime $p$. When $p - 1$ is not divisible by small integers…
The Zeta function of a curve $C$ over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix $\Theta_C$. Following the work of Rudnick, we compute the expected value of $\mbox{tr}(\Theta_C^n)$ over the…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…
For a genus $2$ curve $C$ over $\mathbb{Q}$ whose Jacobian $A$ admits only trivial geometric endomorphisms, Serre's open image theorem for abelian surfaces asserts that there are only finitely many primes $\ell$ for which the Galois action…
In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…
In algebraic geometry, enumerating or finding superspecial curves in positive characteristic $p$ is important both in theory and in computation. In this paper, we propose feasible algorithms to enumerate or find superspecial hyperelliptic…
We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…
In 1985, Schoof devised an algorithm to compute zeta functions of elliptic curves over finite fields by directly computing the numerators of these rational functions modulo sufficiently many primes (see \cite{schoof_1985}). If $E/K$ is an…
In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…
We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…
The zeta function of a curve $C$ over a finite field may be expressed in terms of the characteristic polynomial of a unitary matrix $\Theta_C$. We develop and present a new technique to compute the expected value of…
We give a characterization of the codomain $[\ell]E(k)$ of the multiplication-by-$\ell$ map $[\ell]$ in the case of elliptic curves over a field $k$ of characteristic $\ne 2,3$ with $\ell$-torsion $E[\ell]=\langle W_1,W_2 \rangle$ fully…
As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…