Title :
GPU accelerated elliptic curve cryptography in GF(2m)
Author :
Cohen, Aaron E. ; Parhi, Keshab K.
Author_Institution :
Leanics Corp., Minneapolis, MN, USA
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 López-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 López-Dahab projective coordinate Pi´s, on an nVidia GTX 285 graphics card precomputation of 2iP 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).
Keywords :
Galois fields; coprocessors; public key cryptography; CUDA programming language; GF(2m); GPU accelerated elliptic curve cryptography; LSB Invariant scalar point multiplication; López-Dahab projective coordinate; binary elliptic curve; graphics processing unit; nVidia graphics card; Acceleration; Arithmetic; Computational complexity; Computer graphics; Elliptic curve cryptography; Elliptic curves; Galois fields; Public key cryptography; Security; Sun; Cryptography; Elliptic Curves; GPU; Multicore;
Conference_Titel :
Circuits and Systems (MWSCAS), 2010 53rd IEEE International Midwest Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
978-1-4244-7771-5
DOI :
10.1109/MWSCAS.2010.5548560
