e-ISSN : 0975-3397
Print ISSN : 2229-5631
Home | About Us | Contact Us

ARTICLES IN PRESS

Articles in Press

ISSUES

Current Issue
Archives

CALL FOR PAPERS

CFP 2021

TOPICS

IJCSE Topics

EDITORIAL BOARD

Editors

Indexed in

oa
 

ABSTRACT

Title : Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
Authors : H. K. Pathak, M. Sanghi
Keywords : Elliptic curve cryptography, Scalar multiplication, Signed binary method, NAF, MOF, Complementary recoding.
Issue Date : July 2010
Abstract :
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.
Page(s) : 1024-1028
ISSN : 0975–3397
Source : Vol. 2, Issue.4

All Rights Reserved © 2009-2024 Engg Journals Publications
Page copy protected against web site content infringement by CopyscapeCreative Commons License