Elliptic Curve Point Multiplication Using MBNR and Point Halving

The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. As generalization of double base number system of a number k to multi-base number system (MBNR) provides a faster method for the scalar multiplication is most important and costly operation (in terms of time) in ECC, there is always a need of developing a faster method with lower cost. In this paper we optimize the cost of scalar multiplication using halving and add method instead doubling and tripling methods. The cost is reduced from 40% to 50% with respect to the other fastest techniques.