Low-Latency Elliptic Curve Scalar Multiplication

Joppe W. Bos

Abstract

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.

Details

Publication typeArticle
Published inInternational Journal of Parallel Programming
URLhttp://www.springerlink.com/content/n6581536264k2v12/
Pages532-550
Volume40
Number5
PublisherSpringer
> Publications > Low-Latency Elliptic Curve Scalar Multiplication