Cryptology ePrint Archive: Report 2013/741

Fast Software Implementation of Binary Elliptic Curve Cryptography

Manuel Bluhm and Shay Gueron

Abstract: This paper presents an efficient and side channel protected software implementation of point multiplication for the standard NIST and SECG binary elliptic curves. The enhanced performance is achieved by improving the L\`{o}pez-Dahab/Montgomery method at the algorithmic level, and by leveraging Intel's AVX architecture and the pclmulqdq processor instruction at the coding level. The fast carry-less multiplication is further used to speed up the reduction on the newest Haswell platforms. For the five NIST curves over $GF(2^m)$ with $m$ $\in$ $\{163,233,283,409,571\}$, the resulting point multiplication implementation is about 6 to 12 times faster than that of OpenSSL-1.0.1e, enhancing the ECDHE and ECDSA algorithms significantly.

Category / Keywords: implementation /

Date: received 11 Nov 2013

Contact author: shay at math haifa ac il

Available format(s): PDF | BibTeX Citation

Version: 20131117:011938 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]