首页 | 官方网站   微博 | 高级检索  
     

一种基于边信道原子的快速标量乘算法
引用本文:郝玉洁,殷石. 一种基于边信道原子的快速标量乘算法[J]. 中国通信, 2011, 8(2): 134-139
作者姓名:郝玉洁  殷石
摘    要:

收稿时间:2011-07-15;

A Fast Algorithm of Scalar Multiplication Based on Side- Channel Atomicity
Hao Yujie,Yin Shi. A Fast Algorithm of Scalar Multiplication Based on Side- Channel Atomicity[J]. China Communications, 2011, 8(2): 134-139
Authors:Hao Yujie  Yin Shi
Affiliation:1 School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, P. R. China2 School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu611731, P. R. China
Abstract: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% ifS/M=0.6.
Keywords:jacobi-quartic curve  scalar multiplication  simple power analysis  side-channel atomicity
点击此处可从《中国通信》浏览原始摘要信息
点击此处可从《中国通信》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号