Article

Curve25519: new diffie-hellman speed records

Author:

Daniel J. BernsteinAuthors Info & Claims

PKC'06: Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography

Pages 207 - 228

https://doi.org/10.1007/11745853_14

Published: 24 April 2006 Publication History

Abstract

This paper explains the design and implementation of a high-security elliptic-curve-Diffie-Hellman function achieving record-setting speeds: e.g., 832457 Pentium III cycles (with several side benefits: free key compression, free key validation, and state-of-the-art timing-attack protection), more than twice as fast as other authors' results at the same conjectured security level (with or without the side benefits).

References

[1]

-- (no editor), 17th annual symposium on foundations of computer science, IEEE Computer Society, Long Beach, California, 1976. MR 56:1766. See {52}.

[2]

Kazimierz Alster, Jerzy Urbanowicz, Hugh C. Williams (editors), 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}.

[3]

Adrian Antipa, Daniel Brown, Alfred Menezes, René Struik, Scott Vanstone, Validation of elliptic curve public keys, in {21} (2003), 211-223. MR 2171928. Citations in this paper: §1.

Digital Library

[4]

Roberto M. Avanzi, Aspects of hyperelliptic curves over large prime fields in software implementations, in {36} (2004), 148-162. Citations in this paper: §1, §5.

[5]

Roberto M. Avanzi, Generic algorithms for computing discrete logarithms, in {19} (2005), 477-494. MR 2162735. Citations in this paper: §3, §3.

[6]

Roberto M. Avanzi, Preda Mihăilescu, Generic efficient arithmetic algorithms for PAFFs (processor adequate finite fields) and related algebraic structures (extended abstract), in {43} (2004), 320-334. Citations in this paper: §4.

[7]

Daniel V. Bailey, Christof Paar, Efficient arithmetic in finite field extensions with application in elliptic curve cryptography, Journal of Cryptology 14 (2001), 153- 176. ISSN 0933-2790. Citations in this paper: §1, §4.

Digital Library

[8]

Mihir Bellare (editor), Advances in cryptology--CRYPTO 2000: proceedings of the 20th Annual International Cryptology Conference held in Santa Barbara, CA, August 20-24, 2000, Lecture Notes in Computer Science, 1880, Springer-Verlag, Berlin, 2000. ISBN 3-540-67907-3. MR 2002c:94002. See {14}.

[9]

Andreas Bender, Guy Castagnoli, On the implementation of elliptic curve cryptosystems, in {16} (1990), 186-192. MR 91d:11154. Citations in this paper: §4.

Digital Library

[10]

Kamel Bentahar, The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited (2005). URL: http://eprint.iacr.org/ 2005/307. Citations in this paper: §3.

[11]

Daniel J. Bernstein, The Poly1305-AES message-authentication code, in {32} (2005), 32-49. URL: http://cr.yp.to/papers.html#poly1305. ID 0018d9551b5 546d97c340e0dd8cb5750. Citations in this paper: §4.

Digital Library

[12]

Daniel J. Bernstein, Cache-timing attacks on AES (2005). URL: http://cr.yp.to/ papers.html#cachetiming. IDcd9faae9bd5308c440df50fc26a517b4. Citations in this paper: §1, §4.

[13]

Daniel J. Bernstein, Salsa20 specification (2005). URL: http://cr.yp.to/ snuffle.html. Citations in this paper: §3.

[14]

Ingrid Biehl, Bernd Meyer, Volker Müller, Differential fault attacks on elliptic curve cryptosystems (extended abstract), in {8} (2000), 131-146. URL: http://lecturer. ukdw.ac.id/vmueller/publications.php. Citations in this paper: §1, §3.

Digital Library

[15]

Colin Boyd (editor), Advances in cryptology--ASIACRYPT 2001: proceedings of the 7th international conference on the theory and application of cryptology and information security held on the Gold Coast, December 9-13, 2001, Lecture Notes in Computer Science, 2248, Springer-Verlag, Berlin, 2001. ISBN 3-540-42987-5. MR 2003d:94001. See {59}.

[16]

Gilles Brassard (editor), Advances in cryptology--CRYPTO '89, Lecture Notes in Computer Science, 435, Springer-Verlag, Berlin, 1990. ISBN 0-387-97317-6. MR 91b:94002. See {9}.

[17]

Michael Brown, Darrel Hankerson, Julio López, Alfred Menezes, Software implementation of the NIST elliptic curves over prime fields (2000); see also newer version {18}. URL: http://www.cacr.math.uwaterloo.ca/techreports/ 2000/corr2000-56.ps. Citations in this paper: §1, §5.

[18]

Michael Brown, Darrel Hankerson, Julio López, Alfred Menezes, Software implementation of the NIST elliptic curves over prime fields, in {49} (2001), 250-265; see also older version {17}. MR 1907102.

Digital Library

[19]

Henri Cohen, Gerhard Frey (editors), Handbook of elliptic and hyperelliptic curve cryptography, CRC Press, 2005. ISBN 1-58488-518-1. See {5}, {24}, {25}, {30}.

Digital Library

[20]

Yvo Desmedt (editor), Advances in cryptology--CRYPTO '94, Lecture Notes in Computer Science, 839, Springer-Verlag, Berlin, 1994. See {44}.

Digital Library

[21]

Yvo Desmedt, Public Key Cryptography--PKC 2003, 6th international workshop on theory and practice in public key cryptography, Miami, FL, USA, January 6-8, 2003, proceedings, Lecture Notes in Computer Science, 2567, Springer, Berlin, 2003. ISBN 3-540-00324-X. See {3}.

Digital Library

[22]

Claus Diem, The GHS attack in odd characteristic, Journal of the Ramanujan Mathematical Society 18 (2003), 1-32. MR 2004a:14030. URL: http://www.math. uni-leipzig.de/~diem/preprints. Citations in this paper: §4.

[23]

Whitfield Diffie, Martin Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22 (1976), 644-654. ISSN 0018-9448. MR 55:10141. URL: http://cr.yp.to/bib/entries.html#1976/diffie. Citations in this paper: §3.

Digital Library

[24]

Christophe Doche, Tanja Lange, Arithmetic of elliptic curves, in {19} (2005), 267- 302. MR 2162729. Citations in this paper: §A.

[25]

Christophe Doche, Tanja Lange, Arithmetic of special curves, in {19} (2005), 355- 387. MR 2162731. Citations in this paper: §4.

[26]

Kenny Fong, Darrel Hankerson, Julio López, Alfred Menezes, Field inversion and point halving revisited (2003); see also newer version {27}. URL: http://www. cacr.math.uwaterloo.ca/techreports/2003/tech reports2003.html. Citations in this paper: §1.

[27]

Kenny Fong, Darrel Hankerson, Julio López, Alfred Menezes, Field inversion and point halving revisited, IEEE Transactions on Computers 53 (2004), 1047-1059; see also older version {26}. ISSN 0018-9340.

Digital Library

[28]

Jens Franke, Thorsten Kleinjung, Christof Paar, Jan Pelzl, Christine Priplata, Martin Simka, Colin Stahlke, An efficient hardware architecture for factoring integers with the elliptic curve method, Workshop Record of SHARCS 2005 (2005), 51-62. URL: http://www.best.tuke.sk/simka/pub.html. Citations in this paper: §3, §3.

[29]

Gerhard Frey, How to disguise an elliptic curve (Weil descent) (1998). URL: http://www.cacr.math.uwaterloo.ca/conferences/1998/ecc98/slides. html. Citations in this paper: §4.

[30]

Gerhard Frey, Tanja Lange, Transfer of discrete logarithms, in {19} (2005), 529-543. MR 2162738. Citations in this paper: §3.

[31]

Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone, Faster point multiplication on elliptic curves with efficient endomorphisms, in {38} (2001), 190-200. MR 2003h:14043. Citations in this paper: §5.

Digital Library

[32]

Henri Gilbert, Helena Handschuh (editors), Fast software encryption: 12th international workshop, FSE 2005, Paris, France, February 21-23, 2005, revised selected papers, Lecture Notes in Computer Science, 3557, Springer, 2005. ISBN 3-540- 26541-4. See {11}.

Digital Library

[33]

Darrel Hankerson, Julio Lopez Hernandez, Alfred Menezes, Software implementation of elliptic curve cryptography over binary fields (2000); see also newer version {34}. URL: http://www.cacr.math.uwaterloo.ca/techreports/ 2000/corr2000-42.ps. Citations in this paper: §1.

[34]

Darrel Hankerson, Julio Lopez Hernandez, Alfred Menezes, Software implementation of elliptic curve cryptography over binary fields, in {40} (2000), 1-24; see also older version {33}.

Digital Library

[35]

Darrel Hankerson, Alfred Menezes, Scott Vanstone, Guide to elliptic curve cryptography, Springer, New York, 2004. ISBN 0-387-95273-X. MR 2054891. Citations in this paper: §4.

Digital Library

[36]

Marc Joye, Jean-Jacques Quisquater (editors), Cryptographic hardware and embedded systems--CHES 2004: 6th international workshop, Cambridge, MA, USA, August 11-13, 2004, proceedings, Lecture Notes in Computer Science, 3156, Springer, 2004. ISBN 3-540-22666-4. See {4}.

[37]

Burton S. Kaliski Jr. (editor), Advances in cryptology--CRYPTO '97: 17th annual international cryptology conference, Santa Barbara, California, USA, August 17-21, 1997, proceedings, Lecture Notes in Computer Science, 1294, Springer, 1997. ISBN 3-540-63384-7. MR 99a:94041. See {42}.

Digital Library

[38]

Joe Kilian (editor), Advances in cryptology: CRYPTO 2001, 21st annual international cryptology conference, Santa Barbara, California, USA, August 19-23, 2001, proceedings, Lecture Notes in Computer Science, 2139, Springer, 2001. ISBN 3-540-42456-3. MR 2003d:94002. See {31}.

[39]

Neal Koblitz, Alfred J. Menezes, Another look at "provable security" (2004). URL: http://www.cacr.math.uwaterloo.ca/~ajmeneze/publications/ provable.pdf. Citations in this paper: §3.

Digital Library

[40]

C,etin Kaya Ko,c, Christof Paar, Cryptographic hardware and embedded systems-- CHES 2000: Proceedings of the 2nd International Workshop held in Worcester, MA, USA, August 2000, Lecture Notes in Computer Science, Springer, 2000. ISBN 3-540-42521-7. See {34}.

[41]

Fabian Kuhn, Rene Struik, Random walks revisited: extensions of Pollard's rho algorithm for computing multiple discrete logarithms, in {64} (2001), 212-229. URL: http://www.distcomp.ethz.ch/publications.html. Citations in this paper: §3.

Digital Library

[42]

Chae Hoon Lim, Pil Joong Lee, A key recovery attack on discrete log-based schemes using a prime order subgroup, in {37} (1997), 249-263. URL: http:// dasan.sejong.ac.kr/~chlim/english pub.html. Citations in this paper: §3, §3.

Digital Library

[43]

Mitsuru Matsui, Robert Zuccherato (editors), Selected areas in cryptography: 10th annual international workshop, SAC 2003, Ottawa, Canada, August 14-15, 2003, revised papers, Lecture Notes in Computer Science, 3006, Springer, 2004. ISBN 3-540-21370-8. See {6}.

Digital Library

[44]

Ueli M. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms, in {20} (1994), 271-281. URL: http://www. crypto.ethz.ch/~maurer/publications.html. Citations in this paper: §3.

Digital Library

[45]

Alfred Menezes, Another look at HMQV (2005). URL: http://eprint.iacr.org/ 2005/205. Citations in this paper: §2.

[46]

Victor S. Miller, Use of elliptic curves in cryptography, in {65} (1986), 417-426. MR 88b:68040. Citations in this paper: §1.

Digital Library

[47]

Peter L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation 48 (1987), 243-264. ISSN 0025-5718. MR 88e:11130. URL: http://cr.yp.to/bib/entries.html#1987/montgomery. Citations in this paper: §5.

[48]

A. Muzereau, Nigel P. Smart, Frederik Vercauteren, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS Journal of Computation and Mathematics 7 (2004), 50-72. URL: http://www.lms.ac.uk/ jcm/7/lms2003-034/. Citations in this paper: §3.

[49]

David Naccache (editor), Topics in cryptology--CT-RSA 2001: Proceedings of the Cryptographers' Track at the RSA Conference held in San Francisco, CA, April 8-12, 2001, Lecture Notes in Computer Science, 2020, Springer, 2001. ISBN 3- 540-41898-9. MR 2003a:94039. See {18}.

[50]

Dag Arne Osvik, Adi Shamir, Eran Tromer, Cache atacks and countermeasures: the case of AES (extended version) (2005). URL: http://www.wisdom.weizmann. ac.il/~tromer/. Citations in this paper: §1.

[51]

Colin Percival, Cache missing for fun and profit (2005). URL: http://www. daemonology.net/hyperthreading-considered-harmful/. Citations in this paper: §1.

[52]

Nicholas Pippenger, On the evaluation of powers and related problems (preliminary version), in {1} (1976), 258-263; newer version split into {53} and {54}. MR 58:3682. URL: http://cr.yp.to/bib/entries.html#1976/pippenger. Citations in this paper: §5.

Digital Library

[53]

Nicholas Pippenger, The minimum number of edges in graphs with prescribed paths, Mathematical Systems Theory 12 (1979), 325-346; see also older version {52}. ISSN 0025-5661. MR 81e:05079. URL: http://cr.yp.to/bib/entries.html# 1979/pippenger.

[54]

Nicholas Pippenger, On the evaluation of powers and monomials, SIAM Journal on Computing 9 (1980), 230-250; see also older version {52}. ISSN 0097-5397. MR 82c:10064. URL: http://cr.yp.to/bib/entries.html#1980/pippenger.

Digital Library

[55]

John M. Pollard, Kangaroos, Monopoly and discrete logarithms, Journal of Cryptology 13 (2000), 437-447. ISSN 0933-2790. Citations in this paper: §3.

Digital Library

[56]

John Proos, Christof Zalka, Shor's discrete logarithm quantum algorithm for elliptic curves (2003). URL: http://www.cacr.math.uwaterloo.ca/techreports/ 2003/tech reports2003.html. Citations in this paper: §1.

[57]

Nigel P. Smart, A comparison of different finite fields for use in elliptic curve cryptosystems (2000); see also newer version {58}. URL: http://www.cs.bris.ac. uk/Publications/pub info.jsp?id=1000458.

[58]

Nigel P. Smart, A comparison of different finite fields for elliptic curve cryptosystems, Computers and Mathematics with Applications 42 (2001), 91-100; see also older version {57}. MR 2002c:94033. Citations in this paper: §1.

[59]

Martijn Stam, Arjen K. Lenstra, Speeding up XTR, in {15} (2001), 125-143. MR 2003h:94049. Citations in this paper: §5.

Digital Library

[60]

Edlyn Teske, Square-root algorithms for the discrete logarithm problem (a survey), in {2} (2001), 283-301. MR 2003c:11156. URL: http://www.cacr.math.uwaterloo. ca/~eteske/publications.html. Citations in this paper: §3.

[61]

Edlyn Teske, Computing discrete logarithms with the parallelized kangaroo method (2001); see also newer version {62}. URL: http://www.cacr.math.uwaterloo.ca/ techreports/2001/tech reports2001.html. Citations in this paper: §3.

[62]

Edlyn Teske, Computing discrete logarithms with the parallelized kangaroo method, Discrete Applied Mathematics 130 (2003), 61-82; see also older version {61}. MR 2004h:11112.

Digital Library

[63]

Paul C. van Oorschot, Michael Wiener, Parallel collision search with cryptanalytic applications, Journal of Cryptology 12 (1999), 1-28. ISSN 0933-2790. URL: http://members.rogers.com/paulv/papers/pubs.html. Citations in this paper: §3.

Digital Library

[64]

Serge Vaudenay, Amr M. Youssef (editors), Selected areas in cryptography: 8th annual international workshop, SAC 2001, Toronto, Ontario, Canada, August 16-17, 2001, revised papers, Lecture Notes in Computer Science, 2259, Springer, 2001. ISBN 3-540-43066-0. MR 2004k:94066. See {41}.

[65]

Hugh C. Williams (editor), Advances in cryptology: CRYPTO '85, Lecture Notes in Computer Science, 218, Springer, Berlin, 1986. ISBN 3-540-16463-4. See {46}.

Cited By

Fourné MBraga DJancar JSabt MSchwabe PBarthe GFouque PAcar YBalzarotti DXu W(2024)"These results must be false"Proceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699275(6705-6722)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699275
Zhang JHuang JZhao LChen DKoç ÇBalzarotti DXu W(2024)ENG25519Proceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699257(6381-6398)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699257
Sober MScaffino GSchulte S(2024)Cross-Blockchain Communication Using Oracles With an Off-Chain Aggregation Mechanism Based on zk-SNARKsDistributed Ledger Technologies: Research and Practice10.1145/36781873:4(1-24)Online publication date: 15-Jul-2024
https://dl.acm.org/doi/10.1145/3678187
Show More Cited By

Curve25519: new diffie-hellman speed records

Recommendations

Using 5-isogenies to quintuple points on elliptic curves

Finding multiples of points on elliptic curves is the most important computation in elliptic curve cryptography. Extending the work of C. Doche, T. Icart, and D. Kohel (Efficient scalar multiplication by isogeny decomposition, in: M. Yung, Y. Dodis, A. ...
Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0

The Gallant---Lambert---Vanstone (GLV) method is a very efficient technique for accelerating point multiplication on elliptic curves with efficiently computable endomorphisms. Galbraith et al. (J Cryptol 24(3):446---469, 2011) showed that point ...
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Proceedings of the 28th Annual International Conference on Advances in Cryptology - EUROCRYPT 2009 - Volume 5479

Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert- Vanstone GLV method. We extend results of Iijima, Matsuo, Chao and Tsujii which give such homomorphisms for a large class of ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

PKC'06: Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography

April 2006

542 pages

ISBN:3540338519

Editors:
Moti Yung
Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, New York, NY
,
Yevgeniy Dodis
Computer Science Department, New York University, 1214 Amsterdam Avenue, New York, NY
,
Aggelos Kiayias
Computer Science and Engineering, University of Connecticut, 1214 Amsterdam Avenue, Storrs, CT
,
Tal Malkin
Dept. of Computer Science, Columbia University, 1214 Amsterdam Avenue, Storrs, CT

Sponsors

EADS
RSA Security: RSA Security
Google Inc.
Microsoft: Microsoft
NTT DoCoMo

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 24 April 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

186
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fourné MBraga DJancar JSabt MSchwabe PBarthe GFouque PAcar YBalzarotti DXu W(2024)"These results must be false"Proceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699275(6705-6722)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699275
Zhang JHuang JZhao LChen DKoç ÇBalzarotti DXu W(2024)ENG25519Proceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699257(6381-6398)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699257
Sober MScaffino GSchulte S(2024)Cross-Blockchain Communication Using Oracles With an Off-Chain Aggregation Mechanism Based on zk-SNARKsDistributed Ledger Technologies: Research and Practice10.1145/36781873:4(1-24)Online publication date: 15-Jul-2024
https://dl.acm.org/doi/10.1145/3678187
Bhati ADufka AAndreeva ERoy APreneel BQuek TGao DZhou JCardenas A(2024)Skye: An Expanding PRF based Fast KDF and its ApplicationsProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3637673(1082-1098)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3637673
Fotiadis GGroßschädl JRyan PZhou JChattopadhyay S(2024)X2065: Lightweight Key Exchange for the Internet of ThingsProceedings of the 10th ACM Cyber-Physical System Security Workshop10.1145/3626205.3659153(43-52)Online publication date: 2-Jul-2024
https://dl.acm.org/doi/10.1145/3626205.3659153
Sivaraman NNadjm-Tehrani SJohansson T(2024)Formal Analysis of Julia Key Agreement ProtocolInformation and Communications Security10.1007/978-981-97-8801-9_9(171-190)Online publication date: 27-Aug-2024
https://dl.acm.org/doi/10.1007/978-981-97-8801-9_9
Cherry ABarmpis KShahandashti S(2024)The Emperor is Now Clothed: A Secure Governance Framework for Web User Authentication Through Password ManagersInformation and Communications Security10.1007/978-981-97-8801-9_12(233-252)Online publication date: 27-Aug-2024
https://dl.acm.org/doi/10.1007/978-981-97-8801-9_12
Katz JRosenberg M(2024)LATKE: A Framework for Constructing Identity-Binding PAKEsAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68379-4_7(218-250)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68379-4_7
Anastasova MAzarderakhsh RKermani M(2024)Fully Hybrid TLSv1.3 in WolfSSL on Cortex-M4Applied Cryptography and Network Security Workshops10.1007/978-3-031-61486-6_22(376-395)Online publication date: 5-Mar-2024
https://dl.acm.org/doi/10.1007/978-3-031-61486-6_22
Bui DCouteau GMeyer PPasselègue ARiahinia M(2024)Fast Public-Key Silent OT and More from Constrained Naor-ReingoldAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58751-1_4(88-118)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58751-1_4
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten