Fast GPGPU-Based Elliptic Curve Scalar Multiplication

Eric M.  Mahé; Jean-Marie Chauvet

Paper 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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint. MINOR revision.
Contact author(s): jmc @ massiverand com
History: 2014-03-17: revised; 2014-03-17: received; See all versions
Short URL: https://ia.cr/2014/198
License: CC BY

BibTeX

@misc{cryptoeprint:2014/198,
      author = {Eric M.  Mahé and Jean-Marie Chauvet},
      title = {Fast {GPGPU}-Based Elliptic Curve Scalar Multiplication},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/198},
      year = {2014},
      url = {https://eprint.iacr.org/2014/198}
}