The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Computing in the Jacobian of a hyperelliptic curve
Open accessAbstract
In this paper we present algorithms, suitable for computer use, for computation in the Jacobian of a hyperelliptic curve. We present a reduction algorithm which is asymptotically faster than that of Gauss when the genus g is very large.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Mumford, D. B. (2007) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4577-9 · Cited by 1,519
Speeding the Pollard and elliptic curve methods of factorization
Montgomery, P. L. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866113-7 · Cited by 1,218
Class number, a theory of factorization, and genera
Shanks, D. (1971) · Proceedings of Symposia in Pure Mathematics · doi:10.1090/pspum/020/0316385 · Cited by 518
Mumford, D. (2007) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4578-6 · Cited by 250
A Monte Carlo Factoring Algorithm With Linear Storage
Schnorr, C. P., & Lenstra, H. W. (1984) · Mathematics of Computation · doi:10.1090/s0025-5718-1984-0744939-5 · Cited by 70
A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
Seysen, M. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0878705-x · Cited by 54
Cited by
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Koblitz, N. (1989) · Journal of Cryptology · doi:10.1007/bf02252872 · Cited by 455
Metadata
- Authors
- Cantor, D. G.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1987
- Volume
- 48
- Issue
- 177
- Pages
- 95-101
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W2013383029
- Cited by
- 405
- References
- 7
- FWCI
- 10.06
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Computing in the Jacobian of a hyperelliptic curve. https://app.cochat.ai/papers/10.1090/s0025-5718-1987-0866101-0
- The paper
- Cantor, D. G. (1987). Computing in the Jacobian of a hyperelliptic curve. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1987-0866101-0
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.