Finding the group structure of elliptic curves over finite fields

John B. Friedlander; Carl Pomerance; Igor E. Shparlinski

Finding the group structure of elliptic curves over finite fields

John B. Friedlander^*, Carl Pomerance, Igor E. Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	251-263
Number of pages	13
Journal	Bulletin of the Australian Mathematical Society
Volume	72
Issue number	2
Publication status	Published - Oct 2005

Cite this

@article{33ab5ced8a434197b33c565b1787d3cc,

title = "Finding the group structure of elliptic curves over finite fields",

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.",

author = "Friedlander, {John B.} and Carl Pomerance and Shparlinski, {Igor E.}",

year = "2005",

month = oct,

language = "English",

volume = "72",

pages = "251--263",

journal = "Bulletin of the Australian Mathematical Society",

issn = "0004-9727",

publisher = "Cambridge University Press (CUP)",

number = "2",

}

TY - JOUR

T1 - Finding the group structure of elliptic curves over finite fields

AU - Friedlander, John B.

AU - Pomerance, Carl

AU - Shparlinski, Igor E.

PY - 2005/10

Y1 - 2005/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=29144454937&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:29144454937

SN - 0004-9727

VL - 72

SP - 251

EP - 263

JO - Bulletin of the Australian Mathematical Society

JF - Bulletin of the Australian Mathematical Society

IS - 2

ER -

Finding the group structure of elliptic curves over finite fields

Abstract

Other files and links

Fingerprint

Cite this