Skip to Main content Skip to Navigation
Conference papers

Elliptic Curve point multiplication on GPUs

Abstract : —Acceleration of cryptographic applications on Graphical Processing Units (GPUs) platforms is a research topic with practical interest, because these platforms provide huge computational power for this type of applications. In this paper, we propose a parallel algorithm for Elliptic Curve (EC) point multiplication in order to compute EC cryptography on GPUs. The proposed approach relies in using the Residue Number System (RNS) to extract parallelism on high precision integer arithmetic. Results suggest a maximum throughput of 9990 EC multiplications per second and minimum latency of 24.3 ms for a 224-bit underlying field, for an Nvidia 285 GTX GPU. We present performances up to an order of magnitude better in latency and 122 % in throughput regarding other approaches reported in the related art.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01099281
Contributor : Jean Claude Bajard <>
Submitted on : Thursday, January 29, 2015 - 10:00:41 AM
Last modification on : Thursday, March 21, 2019 - 1:00:42 PM
Long-term archiving on: : Thursday, April 30, 2015 - 10:10:16 AM

File

ASAPsubm2010.pdf
Files produced by the author(s)

Identifiers

Citation

Samuel Antão, Jean-Claude Bajard, Leonel Sousa. Elliptic Curve point multiplication on GPUs. ASAP 2010 --- 21st IEEE International Conference on Application-specific Systems, Architectures and Processors, Jul 2010, Rennes, France. pp.192 - 199, ⟨10.1109/ASAP.2010.5541000⟩. ⟨hal-01099281⟩

Share

Metrics

Record views

239

Files downloads

778