The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Faster Addition and Doubling on Elliptic Curves
Open accessOverview
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
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
(2007) · doi:10.1007/978-0-387-38162-6 · Cited by 1,562
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,361
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
Handbook of Elliptic and Hyperelliptic Curve Cryptography
Lercier, R., Lubicz, D., & Vercauteren, F. (2005) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420034981 · Cited by 1,009
Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems
Coron, J.-S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_25 · Cited by 965
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
Self-citationAdvances in Cryptology – ASIACRYPT 2021
(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 780
(2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5 · Cited by 671
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Mangard, S., Oswald, E., & Popp, T. (2007) · Springer eBooks · Cited by 582
Cited by
High-speed high-security signatures
Bernstein, D. J., Duif, N., Lange, T., Schwabe, P., & Yang, B.-Y. (2012) · Journal of Cryptographic Engineering · doi:10.1007/s13389-012-0027-1 · Cited by 541
Self-citationEgala, B. S., Pradhan, A. K., Badarla, V., & Mohanty, S. P. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3058946 · Cited by 315
Efficient and Side-Channel Resistant Ed25519 on ARM Cortex-M4
Owens, D., Khatib, R. E., Bisheh-Niasar, M., Azarderakhsh, R., & Kermani, M. M. (2024) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2024.3384414 · Cited by 58
Metadata
- Authors
- Bernstein, D. J., & Lange, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-11-05
- Pages
- 29-50
- OpenAlex
- W2154290215
- Cited by
- 442
- References
- 27
- FWCI
- 23.51
- Type
- conference paper
- Language
- en
- Open access
- green
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: Faster Addition and Doubling on Elliptic Curves. https://app.cochat.ai/papers/10.1007/978-3-540-76900-2_3
- The paper
- Bernstein, D. J., & Lange, T. (2007). Faster Addition and Doubling on Elliptic Curves. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-76900-2_3
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.