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 over a finite field . The idea of Schoof’s algorithm is to compute the trace of Frobenius modulo primes and restore it by the Chinese remainder theorem. Atkin’s improvement consists of computing the order of the Frobenius action on and of restricting the number $t \pmod{\ell}t^2 \equiv q (\zeta + \zeta^{-1})^2 \pmod{\ell}\zetar$-th root of unity. In this paper, we generalize Atkin’s formula to the general case of abelian variety of dimension . Classically, finding of the order involves expensive computation of modular polynomials. We study the distribution of the Frobenius orders in case of abelian surfaces and in order to replace these expensive computations by probabilistic algorithms.

生成讲解博客的中文版本

生成AI智能校验的中文版本