Please use this identifier to cite or link to this item: http://hdl.handle.net/11189/5662
DC FieldValueLanguage
dc.contributor.authorShparlinski, Ien_US
dc.contributor.authorSutherland, Andrew Ven_US
dc.date.accessioned2017-06-08T10:57:46Z-
dc.date.available2017-06-08T10:57:46Z-
dc.date.issued2015-
dc.identifier.citationLMS Journal of Computation and Mathematics, vol. 18, issue 1 (2015) pp. 308-322en_US
dc.identifier.urihttp://dx.doi.org/10.1112/S1461157015000017-
dc.identifier.urihttp://hdl.handle.net/11189/5662-
dc.description.abstractFor an elliptic curve E/QE/Q without complex multiplication we study the distribution of Atkin and Elkies primes ℓℓ, on average, over all good reductions of EE modulo primes pp. We show that, under the generalized Riemann hypothesis, for almost all primes pp there are enough small Elkies primes ℓℓ to ensure that the Schoof–Elkies–Atkin point-counting algorithm runs in (logp)4+o(1)(log⁡p)4+o(1) expected time.en_US
dc.language.isoenen_US
dc.publisherLMS Journal of Computation and Mathematicsen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/za/-
dc.subjectAtkin primesen_US
dc.subjectElkies primesen_US
dc.subjectElliptic curvesen_US
dc.titleOn the distribution of Atkin and Elkies primes for reductions of elliptic curves on averageen_US
dc.type.patentArticleen_US
Appears in Collections:Eng - Journal articles (DHET subsidised)
Show simple item record

Page view(s)

63
Last Week
0
Last month
1
checked on Aug 13, 2026

Google ScholarTM

Check


This item is licensed under a Creative Commons License Creative Commons