Elliptic Curve point multiplication on GPUs - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Elliptic Curve point multiplication on GPUs


—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.
Fichier principal
Vignette du fichier
ASAPsubm2010.pdf (364.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01099281 , version 1 (29-01-2015)



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⟩
141 View
522 Download



Gmail Facebook Twitter LinkedIn More