Curve25519: New Diffie-Hellman Speed Records

  • Daniel J. Bernstein
Conference paper

DOI: 10.1007/11745853_14

Volume 3958 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bernstein D.J. (2006) Curve25519: New Diffie-Hellman Speed Records. In: Yung M., Dodis Y., Kiayias A., Malkin T. (eds) Public Key Cryptography - PKC 2006. PKC 2006. Lecture Notes in Computer Science, vol 3958. Springer, Berlin, Heidelberg

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).

Keywords

Diffie-Hellman elliptic curves point multiplication new curve new software high conjectured security high speed constant time short keys 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Daniel J. Bernstein

There are no affiliations available