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

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/51560

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51560

Title:	On the Computational Sequence of Scalar Multiplication with Left-to-Right Recoded NAF and Sliding Window Technique
Authors:	Chen,CN;Yen,SM;Moon,S
Contributors:	資訊工程學系
Date:	2010
Issue Date:	2012-03-27 18:56:15 (UTC+8)
Publisher:	國立中央大學
Abstract:	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.
Relation:	IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	344	View/Open

社群 sharing