Quasi-quadratic elliptic curve point counting using rigid cohomology

Simple item page
dc.creatorHubrechts, Hendrik
dc.date2007-01-29
dc.date.accessioned2026-07-07T07:43:39Z
dc.date.available2026-07-07T07:43:39Z
dc.descriptionWe 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/math/0701850
dc.identifierhttp://arxiv.org/abs/math/0701850
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122909
dc.subjectNumber Theory
dc.subjectAlgebraic Geometry
dc.subject14H52; 11G20
dc.titleQuasi-quadratic elliptic curve point counting using rigid cohomology
dc.typetext

Files

Collections

arXiv