Fast Prime Field Elliptic Curve Cryptography with 256 Bit Primes

Shay Gueron; Vlad Krasnov

Paper 2013/816

Fast Prime Field Elliptic Curve Cryptography with 256 Bit Primes

Shay Gueron and Vlad Krasnov

Abstract

This paper studies software optimization of Elliptic Curve Cryptography with 256-bit prime fields. We propose a constant-time implementation of the NIST and SECG standardized curve P-256, that can be seamlessly integrated into OpenSSL. This accelerates Perfect Forward Secrecy TLS handshakes that use ECDSA and/or ECDHE, and can help improving the efficiency of TLS servers. We report significant performance improvements for ECDSA and ECDH, on several architectures. For example, on the latest Intel Haswell microarchitecture, our ECDSA sign is 2.33x faster than OpenSSL’s implementation.

Note: Fixing a typo in Fig. 11

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint. MINOR revision.
Contact author(s): shay @ math haifa ac il
History: 2013-12-15: revised; 2013-12-06: received; See all versions
Short URL: https://ia.cr/2013/816
License: CC BY

BibTeX

@misc{cryptoeprint:2013/816,
      author = {Shay Gueron and Vlad Krasnov},
      title = {Fast Prime Field Elliptic Curve Cryptography with 256 Bit Primes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/816},
      year = {2013},
      url = {https://eprint.iacr.org/2013/816}
}