The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Speeding up the computations on an elliptic curve using addition-subtraction chains
Open accessAbstract
Speeding up the computations on an elliptic curve using addition-subtraction chainsInformatique théorique et applications, tome 24, n o 6 (1990), p. 531-543.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
Factoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Theorems on factorization and primality testing
Pollard, J. M. (1974) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100049252 · Cited by 402
The arithmetic of elliptic curves
Tate, J. (1974) · Inventiones mathematicae · doi:10.1007/bf01389745 · Cited by 305
Diophantine Equations with Special Reference To Elliptic Curves
Cassels, J. W. S. (1966) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-41.1.193 · Cited by 253
Almost all primes can be quickly certified
Goldwasser, S., & Kilian, J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12162 · Cited by 198
A lower bound for the length of addition chains
Schönhage, A. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90008-0 · Cited by 92
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Efficient Arithmetic on Koblitz Curves
Solinas, J. A. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008306223194 · Cited by 344
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
Cohen, H., Miyaji, A., & Ono, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49649-1_6 · Cited by 296
Software Implementation of the NIST Elliptic Curves Over Prime Fields
Brown, M., Hankerson, D., López, J., & Menezes, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_19 · Cited by 258
Metadata
- Authors
- Morain, F., & Olivos, J.
- Venue
- RAIRO - Theoretical Informatics and Applications
- Publisher
- EDP Sciences
- Published
- 1990
- Volume
- 24
- Issue
- 6
- Pages
- 531-543
- ISSN
- 0988-3754 (ISSN-L)
- 1290-385X
- OpenAlex
- W1584722274
- Cited by
- 258
- References
- 15
- FWCI
- 11.13
- 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: Speeding up the computations on an elliptic curve using addition-subtraction chains. https://app.cochat.ai/papers/10.1051/ita/1990240605311
- The paper
- Morain, F., & Olivos, J. (1990). Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO - Theoretical Informatics and Applications. https://doi.org/10.1051/ita/1990240605311
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.
