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
(1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5 · Cited by 681
(2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5 · Cited by 671
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
(2004) · Lecture notes in computer science · doi:10.1007/b99451 · Cited by 524
Fehr, S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54388-7 · Cited by 445
Software Implementation of Elliptic Curve Cryptography over Binary Fields
Hankerson, D., López Hernandez, J., & Menezes, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44499-8_1 · Cited by 423
Shor's discrete logarithm quantum algorithm for elliptic curves
Proos, J., & Zalka, C. (2003) · Quantum Information and Computation · doi:10.26421/qic3.4-3 · Cited by 421
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Gallant, R. P., Lambert, R. J., & Vanstone, S. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_11 · Cited by 376
The Poly1305-AES Message-Authentication Code
Bernstein, D. J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11502760_3 · Cited by 362
Self-citationDifferential Fault Attacks on Elliptic Curve Cryptosystems
Biehl, I., Meyer, B., & Müller, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_8 · Cited by 323
Topics in Cryptology — CT-RSA 2001
Naccache, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45353-9 · Cited by 318
Cryptographic Hardware and Embedded Systems — CHES 2000
Koç, Ã. K., & Paar, C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44499-8 · Cited by 271
More Flexible Exponentiation with Precomputation
Lim, C. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_11 · Cited by 264
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
Another Look at "Provable Security"
Koblitz, N., & Menezes, A. J. (2007) · Journal of Cryptology · doi:10.1007/s00145-005-0432-z · Cited by 218
A key recovery attack on discrete log-based schemes using a prime order subgroup
Lim, C. H., & Lee, P. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052240 · Cited by 207
Field inversion and point halving revisited
Fong, K., Hankerson, D., Lopez, J., & Menezes, A. (2004) · IEEE Transactions on Computers · doi:10.1109/tc.2004.43 · Cited by 167
On the Evaluation of Powers and Monomials
Pippenger, N. J. (1980) · SIAM Journal on Computing · doi:10.1137/0209022 · Cited by 151
Kangaroos, Monopoly and Discrete Logarithms
Pollard, J. M. (2000) · Journal of Cryptology · doi:10.1007/s001450010010 · Cited by 146
Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography
Bailey, D. V., & Paar, C. (2001) · Journal of Cryptology · doi:10.1007/s001450010012 · Cited by 139
Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms
Maurer, U. M. (1994) · Cited by 133
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
Maurer, U. M. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_26 · Cited by 123
Validation of Elliptic Curve Public Keys
Antipa, A., Brown, D. W., Menezes, A., Struik, R., & Vanstone, S. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_16 · Cited by 113
On the evaluation of powers and related problems
Pippenger, N. J. (1976) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1976.21 · Cited by 94
Menezes, A. (2007) · Journal of Mathematical Cryptology · doi:10.1515/jmc.2007.004 · Cited by 92
Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations
Avanzi, R. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28632-5_11 · Cited by 87
Doche, C., & Lange, T. T. (2006) · TU/e Research Portal · Cited by 74
Another Look at “Provable Security”. II
Koblitz, N., & Menezes, A. (2006) · Lecture notes in computer science · doi:10.1007/11941378_12 · Cited by 70
Square-root algorithms for the discrete logarithm problem (a survey)
Teske, E. (2012) · De Gruyter eBooks · doi:10.1515/9783110881035.283 · Cited by 63
Stam, M., & Lenstra, A. K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_8 · Cited by 62
Another Look at Provable Security
Menezes, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_2 · Cited by 57
Selected Areas in Cryptography
Matsui, M., & Zuccherato, R. J. (2004) · Lecture notes in computer science · doi:10.1007/b96837 · Cited by 55
Kühn, F., & Struik, R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_17 · Cited by 53
Advances in Cryptology – CRYPTO 2017
Shacham, H., & Katz, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63715-0 · Cited by 47
Doche, C., & Lange, T. (2005) · Discrete mathematics and its applications · doi:10.1201/9781420034981.pt3 · Cited by 36
The minimum number of edges in graphs with prescribed paths
Pippenger, N. J. (1978) · Theory of Computing Systems · doi:10.1007/bf01776581 · Cited by 29
Area–time efficient hardware architecture for factoring integers with the elliptic curve method
Pelzl, J., imka, M., Kleinjung, T., et al. (2005) · IEE proceedings. Information security · doi:10.1049/ip-ifs:20055018 · Cited by 29
On the Evaluation of Powers and Related Problems (Preliminary Version)
Pippenger, N. J. (1976) · Cited by 28
A comparison of different finite fields for elliptic curve cryptosystems
Smart, N. P. (2001) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(01)00133-x · Cited by 23
The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
Muzereau, A., Smart, N. P., & Vercauteren, F. (2004) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157000001042 · Cited by 22
On the Implementation of Elliptic Curve Cryptosystems
Bender, A. O., & Castagnoli, G. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_18 · Cited by 18
Computing discrete logarithms with the parallelized kangaroo method
Teske, E. (2003) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(02)00590-5 · Cited by 17
Avanzi, R. M., & Mihăilescu, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24654-1_23 · Cited by 15
Bentahar, K. (2005) · Lecture notes in computer science · doi:10.1007/11586821_25 · Cited by 10
Gilbert, H., & Handschuh, H. (2005) · Springer eBooks · Cited by 6
Gilbert, H., & Handschuh, H. (2008) · Cited by 5
Generic Algorithms for Computing Discrete Logarithms
Avanzi, R. M. (2005) · doi:10.1201/9781420034981.ch19 · Cited by 4
Doche, C., & Lange, T. (2005) · Discrete mathematics and its applications · doi:10.1201/9781420034981.ch15 · Cited by 3
Generic Algorithms for Computing Discrete Logarithms
Avanzi, R. M. (2005) · Discrete mathematics and its applications · doi:10.1201/9781420034981.pt5 · Cited by 3
Transfer of Discrete Logarithms
Frey, G., & Lange, T. (2005) · Discrete mathematics and its applications · doi:10.1201/9781420034981.ch22 · Cited by 2
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
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.