Cryptology ePrint Archive: Report 2014/198

Fast GPGPU-Based Elliptic Curve Scalar Multiplication

Eric M. Mahé and Jean-Marie Chauvet

Abstract: This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a ``General-Purpose computing on Graphics Processing Units'' (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255-bit prime field complying with the new 128-bit security level, computes the scalar multiplication in less than a microsecond on AMD's R9 290X GPU. The presented methods and implementation considerations can be applied to any parallel architecture.

Category / Keywords: implementation / Cryptography GPU symmetric ECC Curve25519 OpenCL

Date: received 16 Mar 2014, last revised 17 Mar 2014

Contact author: jmc at massiverand com

Available format(s): PDF | BibTeX Citation

Version: 20140317:082618 (All versions of this report)

Short URL: ia.cr/2014/198

Discussion forum: Show discussion | Start new discussion