Low-Latency Elliptic Curve Scalar Multiplication
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.
Keywords: Elliptic curve cryptography ; Elliptic curve scalar multiplication ; Parallel computing ; Low-latency algorithm ; Asymmetric Cryptography ; Graphics Hardware ; Aes Encryption ; Implementation ; Cryptosystems
Record created on 2012-08-03, modified on 2016-08-09