Elliptic and modular curves over finite fields and related computational issues
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The problem of calculating the trace of an elliptic curve over a finite field has attracted considerable interest in recent years. There are many good reasons for this. The question is intrinsically compelling, being the first nontrivial case of the natural problem of counting points on a complete projective variety over a finite field, and figures in a variety of contexts, from primality proving to arithmetic algebraic geometry to applications in secure communication. It is also a difficult but rewarding challenge, in that the most successful approaches draw on some surprisingly advanced number theory and suggest new conjectures and results apart from the immediate point-counting problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044
Modular Elliptic Curves and Fermat's Last Theorem
Wiles, A. (1995) · The Annals of Mathematics · doi:10.2307/2118559 · Cited by 2,060
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Metadata
- Authors
- Elkies, N.
- Venue
- AMS/IP Studies in Advanced Mathematics
- Publisher
- American Mathematical Society
- Published
- 1997-12-02
- Pages
- 21-76
- ISSN
- 1089-3288 (ISSN-L)
- 2472-5153
- OpenAlex
- W2146323046
- Cited by
- 188
- References
- 3
- FWCI
- 54.47
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Elliptic and modular curves over finite fields and related computational issues. https://app.cochat.ai/papers/10.1090/amsip/007/03
- The paper
- Elkies, N. (1997). Elliptic and modular curves over finite fields and related computational issues. AMS/IP Studies in Advanced Mathematics. https://doi.org/10.1090/amsip/007/03
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.