On the Computational Sequence of Scalar Multiplication with Left-to-Right Recoded NAF and Sliding Window Technique

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系 > 期刊論文 > Item 987654321/51560

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51560

题名:	On the Computational Sequence of Scalar Multiplication with Left-to-Right Recoded NAF and Sliding Window Technique
作者:	Chen,CN;Yen,SM;Moon,S
贡献者:	資訊工程學系
日期:	2010
上传时间:	2012-03-27 18:56:15 (UTC+8)
出版者:	國立中央大學
摘要:	Simple power analysis (SPA) can be employed in examining the power consumption trace of elliptic curve scalar multiplication to retrieve the computational sequence. However, SPA cannot distinguish point addition from point subtraction. The attacker still requires an exhaustive search to recover the private key when it is recoded in NAF or recoded by the 2-bit sliding window method. The average Hamming weight of an n-bit NAF recoded scalar is n/3, and an exhaustive search among the 2(n)/3 candidates is required. This paper shows that in a left-to-right NAF recoded or a left-to-right 2-bit sliding window manipulated scalar the relative position of nonzero bits will reveal their values. Our analysis skill reduces the number of candidates of the scalar from the naive search of 2(n/3) to 2(2n/9) and 2(0.19n) respectively for the cases of NAF and sliding window method.
關聯:	IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	342	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing