Related papers: Counting points on hyperelliptic curves in average…

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 new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…

Let E_G be a family of hyperelliptic curves over F2^(alg cl) with general Weierstrass equation given over a very small field F. We describe in this paper an algorithm to compute the zeta function of E_g for g in a degree n extension field…

We present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a…

We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.

We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…

We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the…

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…

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

In this work, we investigate hyperelliptic curves of type $C: y^2 = x^{2g+1} + ax^{g+1} + bx$ over the finite field $\mathbb{F}_q, q = p^n, p > 2$. For the case of $g = 3$ and $4$ we propose algorithms to compute the number of points on the…

We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…

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)})$…

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…

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…

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

Let $q$ be an odd prime power, and $H_{d,q}$ denote the set of square-free monic polynomials $D(x) \in F_q[x]$ of degree $d$. Katz and Sarnak showed that the moments, over $H_{d,q}$, of the zeta functions associated to the curves…

We design a fast algorithm that computes, for a given linear differential operator with coefficients in $Z[x ]$, all the characteristic polynomials of its p-curvatures, for all primes $p < N$ , in asymptotically quasi-linear bit complexity…

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…