A Fast Algorithm of Scalar Multiplication Based on Side-Channel Atomicity  

一种基于边信道原子的快速标量乘算法(英文)

作　　者：郝玉洁 殷石 

机构地区：[1]School of Computer Science and Engineering,University of Electronic Science and Technology of China [2]School of Mathematical Sciences,University of Electronic Science and Technology of China

出　　处：《China Communications》2011年第2期134-139,共6页中国通信（英文版）

基　　金：sponsored and financial supported by National Natural Science Foundation of China (NSFC), grant No.61003121;Sichuan Province High Technology Program under No.2009CD00014

摘　　要：Simple power analysis is the most devastating attack on the security of elliptic curve scalar multiplication and can probably retrieve the secret key. In this paper,we analyze the formulas of point doubling and addition on Jacobi-quartic Curve in projective coordination. In addition,a fast and secure side-channel atomic scalar multiplication algorithm is proposed using the side-channel atomic block. Compared with the previous methods,the new algorithm is more efficient. For 192 bits scalar using NAF recoding,the efficiency of the new algorithm is increased by about 6.7%～23% if S/M=0.8 or 12.7%～33.2% if S/M=0.6.Simple power analysis is the most devastating attack on the security of elliptic curve scalar multiplication and can probably retrieve the secret key. In this paper,we analyze the formulas of point doubling and addition on Jacobi-quartic Curve in projective coordination. In addition,a fast and secure side-channel atomic scalar multiplication algorithm is proposed using the side-channel atomic block. Compared with the previous methods,the new algorithm is more efficient. For 192 bits scalar using NAF recoding,the efficiency of the new algorithm is increased by about 6.7%～23% if S/M=0.8 or 12.7%～33.2% if S/M=0.6.

关 键 词：jacobi-quartic curve scalar multipli-cation simple power analysis side-channel atomicity 

分 类 号：TN918.1[电子电信—通信与信息系统]