Computing points on modular curves over finite fields

MaRDI QIDQ6242042zbMATH OpenFDO

Authors Jinxiang Zeng

Publication date 20 May 2013

Mathematics Subject Classification ID

Fourier coefficients of automorphic forms (11F30) Forms of half-integer weight; nonholomorphic modular forms (11F37) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Algebraic functions and function fields in algebraic geometry (14H05) Computational aspects of algebraic curves (14Q05)

Abstract: In this paper, we present a probabilistic algorithm to compute the number of $mathbb{F}_p$-points of modular curve $X_1(n)$. Under the Generalized Riemann Hypothesis(GRH), the algorithm takes $extrmO(n^{56+delta+epsilon}lo{g}^{9+epsilon}p)$ bit operations, where $delta$ is an absolute constant and $epsilon$ is any positive real number. As an application, we can compute $$ for huge primes $p$. For example, we have $$.

This page was built for publication: Computing points on modular curves over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242042)