STM Journals Peer-reviewed research from Consortium e-Learning Network

Journal of Operating Systems Development & Trends

Speeding up Simultaneous Scalar Multiplication on Elliptic Curves

  1. Manju Sanghi

Abstract

Scalar multiplication is the basic and most expensive operation in elliptic curve based cryptographic protocols.  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. Direct- recoding is a new and efficient algorithm for computation of signed binary representation as compared to the existing methods like NAF, MOF and complementary recoding. In this paper, we propose a novel method for speeding up simultaneous scalar multiplication using direct recoding method. Keywords: Elliptic curve cryptography, simultaneous scalar multiplication, signed binary method, NAF, MOF, complementary recoding, JSFMSC: 94A60
Support