Type: Article
Publication Date: 2005-10-01
Citations: 4
DOI: https://doi.org/10.1017/s0004972700035048
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.