Speeding up Elliptic Curve Cryptography on the P-384 Curve

Abstract

The P-384 is one of the standardized elliptic curves by ANSI and NIST. This curve provides a 192-bit security level and is used in the computation of digital signatures and key-agreement protocols. Although several publicly-available cryptographic libraries support the P-384 curve, they have a poor performance. In this work, we present software techniques for accelerating cryptographic operations using the P-384 curve; first, we use the latest vector instructions of Intel processors to implement the prime field arithmetic; second, we devise a parallel scheduling of the complete formulas for point addition law. As a result, on Skylake micro-architecture, our software implementation is 15 percent and 40 percent faster than the OpenSSL library for computing ECDSA signatures and the ECDH protocol, respectively.

Citation

@inproceedings{faz_sbseg2016,
  author = {Armando Faz-Hernández and Julio López},
  title = {Speeding up Elliptic Curve Cryptography on the P-384 Curve},
  booktitle = {Anais do XVI Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais},
  location = {Niterói, RJ, Brasil},
  publisher = {Sociedade Brasileira de Computação},
  address = {Porto Alegre, RS, Brasil},
  year = {2016},
  month = {nov},
  pages = {170--183},
  doi = {10.5753/sbseg.2016.19306}
}