International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 20 - Number 1 |
Year of Publication: 2011 |
Authors: Harsandeep Brar, Rajpreet Kaur |
10.5120/2395-3181 |
Harsandeep Brar, Rajpreet Kaur . Design and Implementation of Block Method for Computing NAF. International Journal of Computer Applications. 20, 1 ( April 2011), 37-41. DOI=10.5120/2395-3181
Elliptic curve based cryptosystem is an efficient public key cryptosystem, which is more suitable for limited environments. The performance of elliptic curve cryptosystem heavily depends on an operation called point multiplication. It is the multiplication of a scalar with the given point on the curve. Scalar multiplication is faster by using signed binary representation as compared to binary representation. In this paper “Block Method” for computing NAF is proposed. The Proposed method is more efficient as compared to standard method for computing NAF. The paper presents the comparative study of both standard and block methods for computing NAF. In this paper we have examined that Overall computation for Point Multiplication operation with NAF method can be made more effective by improving speed of calculating the NAF Part.