Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T23:39:34.183Z Has data issue: false hasContentIssue false

On the complexity of computing the 2-Selmer group of an elliptic curve

Published online by Cambridge University Press:  18 May 2009

S. Siksek
Affiliation:
Institute of Mathematics and Statistics, University of Kent at Canterbury Canterbury, Kent CT2 7NF, England
N. P. Smart
Affiliation:
Hewlett-Packard Laboratories, Filton Road, Stoke Gifford, Bristol Bs12 6Qz, England
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we give an algorithm for computing the 2-Selmer group of an elliptic curve

which has complexity O(LD(0·5),c1)), where D is the absolute discriminant of the curve. Our algorithm is unconditional but the complexity estimate assumes the GRH and a standard conjecture on the distribution of smooth reduced ideals. This improves on the corresponding algorithm of Birch and Swinnerton-Dyer, which has complexity of O(√D).

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1997