Abstract
We show that an algorithm of V. Miller to compute the group structure of an elliptic curve over a prime finite field runs in probabilistic polynomial time for almost all curves over the field. Important to our proof are estimates for some divisor sums. Copyright Clearance Centre, Inc.
Cite
CITATION STYLE
APA
Friedlander, J. B., Pomerance, C., & Shparlinski, I. E. (2005). Finding the group structure of elliptic curves over finite fields. Bulletin of the Australian Mathematical Society, 72(2), 251–263. https://doi.org/10.1017/s0004972700035048
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free