Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4

Abstract

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

Authors and Affiliations

H. K. Pathak , Manju Sanghi

Keywords

Related Articles

Clustered Chain based Power Aware Routing (CCPAR) Scheme for Wireless Sensor Networks

Wireless sensor networks with thousands of tiny sensor nodes are becoming immensely popular due to their wide applicability in multitude of applications such as monitoring and collecting data from unattended hazardous en...

Optimal Feed Forward MLPArchitecture for Off-Line Cursive Numeral Recognition

The purpose of this work is to analyze the performance of back-propagation feed-forward algorithm using various different activation functions for the neurons of hidden and output layer and varying the number of neurons...

SEGMENTATION OF OIL SPILL IMAGES USING IMPROVED FCM AND LEVEL SET METHODS.

The main part of image processing and computer vision is Image segmentation. Image segmentation is the task of splitting a digital image into one or more regions of interest. In this paper a robust method for oil spill S...

Malaysian Car Number Plate Detection System Based on Template Matching and Colour Information

This paper presents a method for Malaysian car number plate detection system. This method utilizes template matching echnique to approximate the location of the number plate region. Using the output from this template m...

Public key cryptosystem and a key exchange protocol using tools of non-abelian group

Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a lock of encrypted data. We...

Download PDF file
  • EP ID EP119019
  • DOI -
  • Views 107
  • Downloads 0

How To Cite

H. K. Pathak, Manju Sanghi (2010). Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem. International Journal on Computer Science and Engineering, 2(4), 1024-1028. https://europub.co.uk/articles/-A-119019