Related papers: Counting points on abelian surfaces over finite fi…
Let $E$ be an elliptic curve over a finite field $\mathbb{F}_q$ where $q$ is a prime power. The Schoof--Elkies--Atkin (SEA) algorithm is a standard method for counting the number of $\mathbb{F}_q$-points on $E$. The asymptotic complexity of…
We generalize the notion of Elkies primes for elliptic curves to the setting of abelian varieties with real multiplication (RM), and prove the following. Let $A$ be an abelian variety with RM over a number field whose attached Galois…
We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…
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…
We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…
In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…
For an elliptic curve E/Q without complex multiplication we study the distribution of Atkin and Elkies primes l, on average, over all good reductions of E modulo primes p. We show that, under the Generalised Riemann Hypothesis, for almost…
Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
This article reports on an approach to point counting on algebraic varieties over finite fields that is based on a detailed investigation of the $2$-adic orthogonal group. Combining the new approach with a $p$-adic method, we count the…
Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational…
Baba and Granath generalize Elkies' theorem on infinitude of supersingular primes for elliptic curves to abelian surfaces with quaternionic multiplication of discriminant $6$, whose field of moduli is $\mathbb{Q}$ and which is a Jacobian in…
The computation of the order of Frobenius action on the $\ell$-torsion is a part of Schoof-Elkies-Atkin algorithm for point counting on an elliptic curve $E$ over a finite field $\mathbb{F}_q$. The idea of Schoof's algorithm is to compute…
This work builds on earlier results. We define universal elliptic Gau{\ss} sums for Atkin primes in Schoof's algorithm for counting points on elliptic curves. Subsequently, we show these quantities admit an efficiently computable…
Let $E$ be an elliptic surface over the curve $C$, defined over a number field $k$, let $P$ be a section of $E$, and let $\ell$ be a rational prime. For any non-singular fibre $E_t$, we bound the number of points $Q$ on $E_t$ of (algebraic)…
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)})$…
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…
We report on our project to find explicit examples of $K3$ surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM. In order to do this, an efficient method is needed for…
We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…
We study rational points on the elliptic surface given by the equation: $$y^2 = x^3 + AxQ(u,v)^2 + BQ(u,v)^3,$$ where $A,B\in \mathbb{Z}$ satisfy that $4A^3-27B^2\neq 0$ and $Q(u,v)$ is a positive-definite quadratic form. We prove…