Low-Latency Elliptic Curve Scalar Multiplication

被引：19
作者：
Bos, Joppe W. [1 ]
机构：
[1] Ecole Polytech Fed Lausanne, Lab Cryptol Algorithms, CH-1015 Lausanne, Switzerland
来源：
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING | 2012年 / 40卷 / 05期
基金：
瑞士国家科学基金会;
关键词：
Elliptic curve cryptography; Elliptic curve scalar multiplication; Parallel computing; Low-latency algorithm; GRAPHICS; IMPLEMENTATION; CRYPTOGRAPHY;
D O I：
10.1007/s10766-012-0198-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：532 / 550
页数：19
相关论文
共 56 条
[1]  
AMD, 2006, ATI CTM REF GUID TEC
[2]  
[Anonymous], 2010, NVIDIA CUDA Programming Guide
[3]  
[Anonymous], 2009, NVIDIAS NEXT GEN CUD
[4]  
[Anonymous], 2009, P WORKSH REC SHARCS
[5]  
[Anonymous], 2002, CRYPTOLOGY EPRINT AR
[6]  
[Anonymous], P 21 IEEE INT C APPL
[7]  
[Anonymous], 9939 CORR U WAT
[8]  
Bernstein DJ, 2008, CONTEMP MATH, V461, P1
[9]  
Bernstein DJ, 2007, LECT NOTES COMPUT SC, V4833, P29
[10]  
Bernstein DJ, 2010, LECT NOTES COMPUT SC, V6498, P328, DOI 10.1007/978-3-642-17401-8_23
123456