Related papers: Point counting in families of hyperelliptic curves…
We present an algorithm that, for every fixed degree $n\ge 3$, will enumerate all degree-$n$ places of the projective line over a finite field $k$ up to the natural action of $\operatorname{PGL}_2(k)$ using $O(\log q)$ space and…
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 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…
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 the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…
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…
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…
We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…
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…
We study hyperelliptic curves y^2=f(x) over local fields of odd residue characteristic. We introduce the notion of a "cluster picture" associated to the curve, that describes the p-adic distances between the roots of f(x), and show that…
This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from 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)})$…
For each group $G$, $(|G| > 2)$ \, which acts as a full automorphism group on a genus 3 hyperelliptic curve, we determine the family of curves which have 2-Weierstrass points. Such families of curves are explicitly determined in terms of…
A geometric algorithm is introduced for finding a symplectic basis of the first integral homology group of a compact Riemann surface, which is a $p$-cyclic covering of ${\mathbb C} P^1$ branched over 3 points. The algorithm yields a…
This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…
We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…
In this article we give the details of an effective point counting algorithm for genus two curves over finite fields of characteristic three. The algorithm has an application in the context of curve based cryptography. One distinguished…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
We give improvements of the deformation method for computing the zeta function of a generic projective hypersurface in characteristic~$p$ that either reduce the dependence on~$p$ of the time complexity to $\tilde{O}(p^{1/2})$ or that of the…