Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

摘要

The basic operation in elliptic curve cryptosystem is scalar multiplication. It is the computation of integer multiple of a given point on the curve. Computation of scalar multiple is faster by using signed binary representation as compared to binary representation. In this paper ?Direct Recoding Method? a new modified algorithm for computation of signed binary representation is proposed. Our proposed method is efficient when compared to other standard methods such as NAF, MOF and complementary recoding method.