arXiv · math/0701850
Quasi-quadratic elliptic curve point counting using rigid cohomology
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.
Explore related subjects
Keep this discovery
Hendrik Hubrechts. 2007-01-29. Quasi-quadratic elliptic curve point counting using rigid cohomology. https://arxiv.org/abs/math/0701850
Cite the original work for its findings. Save a collection to share your selection of sources.