8116

Low-Latency Elliptic Curve Scalar Multiplication

Joppe W. Bos
Laboratory for Cryptologic Algorithms, Ecole Polytechnique Federale de Lausanne (EPFL), Station 14, CH-1015 Lausanne, Switzerland
International Journal of Parallel Programming, Volume 40, Number 5, 532-550, 2012

@article{bos2012low,

   title={Low-Latency Elliptic Curve Scalar Multiplication},

   author={Bos, J.W.},

   journal={International Journal of Parallel Programming},

   pages={1–19},

   year={2012},

   publisher={Springer}

}

Download Download (PDF)   View View   Source Source   

1322

views

This paper presents a low-latency algorithm designed for parallel computer architectures to compute the scalar multiplication of elliptic curve points based on approaches from cryptographic side-channel analysis. A graphics processing unit implementation using a standardized elliptic curve over a 224-bit prime field, complying with the new 112-bit security level, computes the scalar multiplication in 1.9 ms on the NVIDIA GTX 500 architecture family. The presented methods and implementation considerations can be applied to any parallel 32-bit architecture.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: