GPU accelerated elliptic curve cryptography in GF(2m)

Aaron E. Cohen, Keshab K Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations

Abstract

This paper presents the Graphics Processing Unit (GPU) accelerated version of the LSB Invariant scalar point multiplication for binary elliptic curves. This method was implemented using the CUDA programming language for nVidia graphics cards. With a parallel factor of (length+1) and Ĺopez- Dahab projective coordinate Pi's, on an nVidia GTX 285 graphics card precomputation takes 190.203995 ms while the actual scalar point multiplication takes 173.121002 ms for GF(2163). With a parallel factor of (length+1)*(length) and Ĺopez-Dahab projective coordinate P i's, on an nVidia GTX 285 graphics card precomputation of 2 iP points takes 9.545 ms while the actual scalar point multiplication takes 10.743 ms (∼93.0839 kP/s) for GF(2163). With a parallel factor of (length+1)*(length) and affine coordinate Pi's, on an nVidia GTX 285 graphics card precomputation takes 140.078003 ms for GF(2163) while the actual scalar point multiplication takes 10.363000 ms (∼96.4972 kP/s) for GF(2163).

Original languageEnglish (US)
Title of host publication2010 IEEE International 53rd Midwest Symposium on Circuits and Systems, MWSCAS 2010
Pages57-60
Number of pages4
DOIs
StatePublished - Sep 20 2010
Event53rd IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2010 - Seattle, WA, United States
Duration: Aug 1 2010Aug 4 2010

Publication series

NameMidwest Symposium on Circuits and Systems
ISSN (Print)1548-3746

Other

Other53rd IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2010
CountryUnited States
CitySeattle, WA
Period8/1/108/4/10

Keywords

  • Cryptography
  • Elliptic Curves
  • GPU
  • Multicore

Fingerprint Dive into the research topics of 'GPU accelerated elliptic curve cryptography in GF(2<sup>m</sup>)'. Together they form a unique fingerprint.

Cite this