Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation /

Date: received 4 Dec 2013, last revised 15 Dec 2013

Contact author: shay at math haifa ac il

Available format(s): PDF | BibTeX Citation

Note: Fixing a typo in Fig. 11

Version: 20131215:082337 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]