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.
|Number of pages||13|
|Journal||Bulletin of the Australian Mathematical Society|
|Publication status||Published - Oct 2005|