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). © International Association for Cryptologic Research 2006.
CITATION STYLE
Bernstein, D. J. (2006). Curve25519: New Diffie-Hellman speed records. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3958 LNCS, pp. 207–228). Springer Verlag. https://doi.org/10.1007/11745853_14
Mendeley helps you to discover research relevant for your work.