Related papers: Counting points on abelian surfaces over finite fi…

We give an algorithm to determine factorization types of primes in the number fields generated by a single point of odd order on an elliptic curve. We apply this to compute coefficients of the Dedekind zeta function of the field.

For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at…

In this paper, we present efficient algorithms for computing the number of points and the order of the Jacobian group of a superelliptic curve over finite fields of prime order p. Our method employs the Hasse-Weil bounds in conjunction with…

For a prime $p{\,>\,}3$ and a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$ with ${j(E)\notin\{0,1728\}}$, consider an endomorphism $\alpha$ of $E$ represented as a composition of $L$ isogenies of degree at most $d$. We…

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

We use Macaulay2 for several enriched counts in GW(k). First, we compute the count of lines on a general cubic surface using Macaulay2 over Fp in GW(Fp) for p a prime number and over the rational numbers Q in GW(Q). This gives a new proof…

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

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 a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

We consider algebraic affine and projective curves of Edwards \cite{E, SkOdProj} over a finite field $\text{F}_{p^n}$. Most cryptosystems of the modern cryptography \cite{SkBlock} can be naturally transform into elliptic curves \cite{Kob}.…

Fix an integer $d>0$. In 2008, David and Weston showed that, on average, an elliptic curve over $\mathbf{Q}$ picks up a nontrivial $p$-torsion point defined over a finite extension $K$ of the $p$-adics of degree at most $d$ for only…

Heuristics based on the Sato--Tate conjecture suggest that an abelian surface defined over a number field has infinitely many places of split reduction. We prove this result for abelian surfaces having real multiplication. Similar to…

We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…

We investigate a problem considered by Zagier and Elkies, of finding large integral points on elliptic curves. By writing down a generic polynomial solution and equating coefficients, we are led to suspect four extremal cases that still…

We give upper and lower bounds on the number of points on abelian varieties over finite fields, and lower bounds specific to Jacobian varieties. We also determine exact formulas for the maximum and minimum number of points on Jacobian…

Given an elliptic curve $E$ and a finite Abelian group $G$, we consider the problem of counting the number of primes $p$ for which the group of points modulo $p$ is isomorphic to $G$. Under a certain conjecture concerning the distribution…

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…

For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…

Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…

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…