Efficient Scalar Multiplication over Elliptic Curve

Deepika Kamboj, D.K. Gupta, Amit Kumar
2016 International Journal of Computer Network and Information Security  
Elliptic Curve Scalar multiplication is the method of adding a point on the curve to itself every time [1] . In recent years, research in Scalar Multiplication over Elliptic curves (EC) over a finite fields attracted many researchers, working in field of cryptography, to find out how elliptic curves cryptography (ECC) can be implemented and how to reduce its complexity [4] . The efficient techniques used in Elliptic curve cryptography are Elliptic curve scalar multiplication using pointhalving
more » ... using pointhalving algorithm [2], then double-base (DB) chain algorithm, and after that step multi-base representation (SMBR), but these techniques have their drawbacks. So, it become imperative to find out a new approach which can be efficiently used for implementation of ECC and further reducing its complexity. The paper proposes a new algorithm Treble algorithm for affine coordinates. We continued doing work using the binary concept or double and add operation with the help of treble approach to make it more efficient which relates to the use of all input values in producing any type of output, including how much time and energy are required The results show that our contribution can significantly enhance EC scalar multiplication. Index Term-Elliptic curve cryptography, double and add operation, affine coordinates.
doi:10.5815/ijcnis.2016.04.07 fatcat:hk4csypqjrdydkbqzaw5kn6qhq