Curve25519: New Diffie-Hellman Speed Records
The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
Cache Attacks and Countermeasures: The Case of AES
Osvik, D. A., Shamir, A., & Tromer, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/11605805_1 · Cited by 1,352
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
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
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
(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 789
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6 · Cited by 779
Research works printed but not linked: 19
- 17th annual symposium on foundations of computer science. IEEE Computer Society, Long Beach (1976); MR 56:1766. See [52].
- Alster, K., Urbanowicz, J., Williams, H.C. (eds.): Public-key cryptography and computational number theory: proceedings of the international conference held in Warsaw, September 11–15, 2000. Walter de Gruyter, Berlin (2001); ISBN 3–11–017046–9. MR 2002h:94001. See [60]
- Bellare, M. (ed.): CRYPTO 2000. LNCS, vol. 1880. Springer, Heidelberg (2000); ISBN 3–540–67907–3. MR 2002c:94002. See [14]
- Boyd, C. (ed.): ASIACRYPT 2001. LNCS, vol. 2248. Springer, Heidelberg (2001); ISBN 3–540–42987–5. MR 2003d:94001. See [59]
- Brassard, G. (ed.): CRYPTO 1989. LNCS, vol. 435. Springer, Heidelberg (1990); ISBN 0–387–97317–6. MR 91b:94002. See [9]
- Desmedt, Y. (ed.): CRYPTO 1994. LNCS, vol. 839. Springer, Heidelberg (1994); See [44]
- Desmedt, Y. (ed.): PKC 2003. LNCS, vol. 2567. Springer, Heidelberg (2002); ISBN 3–540–00324–X. See [3]
- Diem, C.: The GHS attack in odd characteristic. Journal of the Ramanujan Mathematical Society 18, 1–32 (2003); MR 2004a:14030. Citations in this paper: §4, http://www.math.uni-leipzig.de/~diem/preprints
- Fong, K., Hankerson, D., López, J., Menezes, A.: Field inversion and point halving revisited. IEEE Transactions on Computers 53, 1047–1059 (2004); see also older version [26]. ISSN 0018–9340 · DOI · Paper page
- Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Simka, M., Stahlke, C.: In: Workshop Record of SHARCS 2005, pp. 51???62 (2005);
- Gilbert, H., Handschuh, H. (eds.): FSE 2005. LNCS, vol. 3557. Springer, Heidelberg (2005); ISBN 3–540– 26541–4. See [11].
- Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields (2000); · DOI · Paper page
- Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields. In: [40], pp. 1–24 (2000); see also older version [33] · DOI · Paper page
- Joye, M., Quisquater, J.-J. (eds.): CHES 2004. LNCS, vol. 3156. Springer, Heidelberg (2004); ISBN 3–540–22666–4. See [4]
- Kaliski Jr., B.S. (ed.): CRYPTO 1997. LNCS, vol. 1294. Springer, Heidelberg (1997); ISBN 3–540–63384–7. MR 99a:94041. See [42]
- Kilian, J. (ed.): CRYPTO 2001. LNCS, vol. 2139. Springer, Heidelberg (2001); ISBN 3–540–42456–3. MR 2003d:94002. See [31]
- Naccache, D. (ed.): CT-RSA 2001. LNCS, vol. 2020. Springer, Heidelberg (2001); ISBN 3– 540–41898–9. MR 2003a:94039. See [18]
- Vaudenay, S., Youssef, A.M. (eds.): SAC 2001. LNCS, vol. 2259. Springer, Heidelberg (2001); ISBN 3–540–43066–0. MR 2004k:94066. See [41]
- Williams, H.C. (ed.): CRYPTO 1985. LNCS, vol. 218. Springer, Heidelberg (1986); ISBN 3–540–16463–4. See [46]
Cited by
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Self-citationHigh-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-citationFaster Addition and Doubling on Elliptic Curves
Bernstein, D. J., & Lange, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_3 · Cited by 442
Self-citationPrivacy-Friendly Aggregation for the Smart-Grid
Kursawe, K., Danezis, G., & Kohlweiss, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22263-4_10 · Cited by 378
Elliptic Curve Cryptography in Practice
Bos, J. W., Halderman, J. A., Heninger, N., Moore, J., Naehrig, M., & Wustrow, E. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45472-5_11 · Cited by 321
Scalable Bias-Resistant Distributed Randomness
Syta, E., Jovanovic, P., Kogias, E. K., Gailly, N., Gasser, L., Khoffi, I., Fischer, M. J., & Ford, B. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.45 · Cited by 290
Doubly-Efficient zkSNARKs Without Trusted Setup
Wahby, R. S., Tzialla, I., Shelat, A., Thaler, J., & Walfish, M. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00060 · Cited by 276
SoK: Computer-Aided Cryptography
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00008 · Cited by 143
Riffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Hülsing, A., Ning, K.-C., Schwabe, P., Weber, F. J., & Zimmermann, P. R. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00030 · Cited by 75
“WireGuard instantiates the DH key exchange with X25519 [3].”
BackgroundInfluentialEfficient 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
“3) Modular Inversion: Although the X25519-Cortex - M4 project includes code for inversion, we chose to implement the Itoh-Tsuji method proposed in [28] which uses 11 modular multiplications and 254 modular squares to compute a p − 2 ≡ a 1 mod p in 53% less cycles than [17].”
MethodDrive-By Key-Extraction Cache Attacks from Portable Code
Genkin, D., Pachmanov, L., Tromer, E., & Yarom, Y. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93387-0_5 · Cited by 57
Sowa, J., Hoang, B., Yeluru, A., Qie, S., Nikolich, A., Iyer, R., & Cao, P. (2024) · 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00213 · Cited by 15
Approximate encoded permutations and piecewise quantum adders
Gidney, C. (2019) · arXiv · doi:10.48550/arxiv.1905.08488 · Cited by 3
Metadata
- Authors
- Bernstein, D. J.
- Corresponding author
- Bernstein, Daniel J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 207-228
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1910751411
- Cited by
- 859
- References
- 60
- Citations by year
- 2026: 40 · 2025: 52 · 2024: 48 · 2023: 61 · 2022: 62 · 2021: 74 · 2020: 70 · 2019: 84 · 2018: 64 · 2017: 67 · 2016: 50 · 2015: 55 · 2014: 46 · 2013: 18 · 2012: 19
- FWCI
- 6.40
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- TU/e Research Portal (publishedVersion)
- TU/e Research Portal (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- Curve25519, elliptic curve Diffie-Hellman, key exchange, elliptic curve cryptography, key compression
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.