On the distribution of orders of Frobenius action on ℓ-torsion of abelian surfaces

01/10/2020
by   Nikita Kolesnikov, et al.
0

The computation of the order of Frobenius action on the ℓ-torsion is a part of Schoof-Elkies-Atkin algorithm for point counting on an elliptic curve E over a finite field F_q. The idea of Schoof's algorithm is to compute the trace of Frobenius t modulo primes ℓ and restore it by the Chinese remainder theorem. Atkin's improvement consists of computing the order r of the Frobenius action on E[ℓ] and of restricting the number t ℓ to enumerate by using the formula t^2 ≡ q (ζ + ζ^-1)^2 ℓ. Here ζ is a primitive r-th root of unity. In this paper, we generalize Atkin's formula to the general case of abelian variety of dimension g. Classically, finding of the order r involves expensive computation of modular polynomials. We study the distribution of the Frobenius orders in case of abelian surfaces and q ≡ 1 ℓ in order to replace these expensive computations by probabilistic algorithms.

READ FULL TEXT
research
05/19/2020

The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace

We present the formula for the number of monic irreducible polynomials o...
research
03/03/2022

Counting points on abelian surfaces over finite fields with Elkies's method

We generalize Elkies's method, an essential ingredient in the SEA algori...
research
07/18/2021

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields

For smooth finite fields F_q (i.e., when q-1 factors into small primes) ...
research
06/15/2019

A parametrized Poincare-Hopf Theorem and Clique Cardinalities of graphs

Given a locally injective real function g on the vertex set V of a finit...
research
01/06/2016

A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions

We consider the problem of computing the monic gcd of two polynomials ov...
research
07/30/2019

Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module

Motivated by finding analogues of elliptic curve point counting techniqu...
research
01/03/2021

Computing Cliques and Cavities in Networks

Complex networks have complete subgraphs such as nodes, edges, triangles...

Please sign up or login with your details

Forgot password? Click here to reset