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.
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
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-citation(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 789
(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
A normal form for elliptic curves
Edwards, H. M. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01153-6 · Cited by 498
The Montgomery Powering Ladder
Joye, M., & Yen, S.-M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_22 · Cited by 496
Cryptographic Hardware and Embedded Systems — CHES 2001
Koç, Ã. K., Paar, C., & Naccache, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44709-1 · Cited by 370
Advances in Cryptology — ASIACRYPT’98
Ohta, K., & Pei, D. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49649-1 · Cited by 327
Weierstraß Elliptic Curves and Side-Channel Attacks
Brier, É., & Jóye, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45664-3_24 · Cited by 299
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
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cohen, G., Mora, T., & Moreno, Ó. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56686-4 · Cited by 295
Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
Chevallier-Mames, B., Ciet, M., & Joye, M. (2004) · IEEE Transactions on Computers · doi:10.1109/tc.2004.13 · Cited by 277
Bernstein, D. J., Birkner, P., Jóye, M., Lange, T., & Peters, C. (2008) · Cited by 141
Self-citationCryptographic Hardware and Embedded Systems
Koç, Ã. K., & Paar, C. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48059-5 · Cited by 121
The Jacobi Model of an Elliptic Curve and Side-Channel Analysis
Billet, O., & Jóye, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44828-4_5 · Cited by 104
Efficient exponentiation using precomputation and vector addition chains
de Rooij, P. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053453 · Cited by 99
Doche, C., & Lange, T. T. (2006) · TU/e Research Portal · Cited by 74
Self-citationComplete Systems of Two Addition Laws for Elliptic Curves
Bosma, W., & Lenstra, H. W. (1995) · Journal of Number Theory · doi:10.1006/jnth.1995.1088 · Cited by 60
Batch verification with applications to cryptography and checking
Mihir Bellare, Y., Garay, J. A., & Rabin, T. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054320 · Cited by 42
Doche, C., & Lange, T. (2005) · Discrete mathematics and its applications · doi:10.1201/9781420034981.pt3 · Cited by 36
Self-citationBernstein, D. J., Birkner, P., Lange, T., et al. (2008) · Cited by 8
Self-citation
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
“The specification for Ed25519 [19] instructs the imple-menter to project affine points of the form ( x , y ) to Twisted Edwards Curve points of the form ( X : Y : Z ) as described in [36], which decreases the latency of group operations like Point Addition.”
Background
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
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.