%0 Journal Article
%T Fixed-Base Comb with Window-Non-Adjacent Form (NAF) Method for Scalar Multiplication
%A Hwajeong Seo
%A Hyunjin Kim
%A Taehwan Park
%A Yeoncheol Lee
%A Zhe Liu
%A Howon Kim
%J Sensors
%D 2013
%I MDPI AG
%R 10.3390/s130709483
%X Elliptic curve cryptography (ECC) is one of the most promising public-key techniques in terms of short key size and various crypto protocols. For this reason, many studies on the implementation of ECC on resource-constrained devices within a practical execution time have been conducted. To this end, we must focus on scalar multiplication, which is the most expensive operation in ECC. A number of studies have proposed pre-computation and advanced scalar multiplication using a non-adjacent form (NAF) representation, and more sophisticated approaches have employed a width-w NAF representation and a modified pre-computation table. In this paper, we propose a new pre-computation method in which zero occurrences are much more frequent than in previous methods. This method can be applied to ordinary group scalar multiplication, but it requires large pre-computation table, so we combined the previous method with ours for practical purposes. This novel structure establishes a new feature that adjusts speed performance and table size finely, so we can customize the pre-computation table for our own purposes. Finally, we can establish a customized look-up table for embedded microprocessors.
%K public key cryptography
%K elliptic curve cryptography
%K scalar multiplication
%K fixed-base comb method
%K window-NAF method
%K efficient implementation
%K embedded microprocessor
%U http://www.mdpi.com/1424-8220/13/7/9483