Paper 2013/816 Original: eprint.iacr.org/2013/816 ↗
Fast Prime Field Elliptic Curve Cryptography with 256 Bit Primes
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2013-12-15: last updated
- 2013-12-06: published
- Short URL
- https://ia.cr/2013/816
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}