Quasi-quadratic elliptic curve point counting using rigid cohomology
classification
🧮 math.NT
math.AG
keywords
algorithmcohomologycurveellipticquasi-quadraticrigidtimeuses
read the original abstract
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the canonical lift of E, whereas our algorithm uses rigid cohomology combined with a deformation approach. An implementation in small odd characteristic turns out to give very good results.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.