A Kind of Fast Scalar Multiplication Using Point Halving for ECC
Liu Shuanggen · ASME Press eBooks · 2011
The fast implementation of elliptic curve cryptosystems heavily relies on the efficient computation of scalar multiplication. Scalar multiplication is most important and costly operation in ECC, there is always a need of developing a faster method with lower costGeneralization of double-base number system of a number k to multi-base number system provides a faster method for scalar multiplication. In this paper we optimize the cost of scalar multiplication using halving and add method instead of doubling and add methods. Using this method the cost is reduced from 40 percent to 50 percent with respect to the other techniques of number representation.