On the Computational Sequence of Scalar Multiplication with Left-to-Right Recoded NAF and Sliding Window Technique
スポンサーリンク
概要
- 論文の詳細を見る
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 2n/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 2n/3 to 22n/9 and 20.19n respectively for the cases of NAF and sliding window method.
- （社）電子情報通信学会の論文
- 2010-10-01
著者
-
Moon Sangjae
School Of Electrical Engineering And Computer Science Kyungpook National University
-
Yen Sung-ming
Dept Of Computer Science And Information Engineering National Central University
-
Chen Chien-ning
Dept Of Computer Science And Information Engineering National Central University
関連論文
- Secure Route Discovery Protocol for Ad Hoc Networks(Mobile Information Network and Personal Communications)
- Cryptanalysis on the Robust and Simple Authentication Protocol for Secure Communication on the Web(Information Security)
- On the Computational Sequence of Scalar Multiplication with Left-to-Right Recoded NAF and Sliding Window Technique
- A Distributed Sign-and-Encryption for Anonymity
- A Distributed Sign-and-Encryption for Anonymity (Cryptography and Information Security)
- An Attack on the Identity-Based Key Agreement Protocols in Multiple PKG Environment (Information Security)
- Modified Doubling Attack by Exploiting Chosen Ciphertext of Small Order
- A DPA Attack on the Implementation of RSA-CRT with Montgomery Reduction