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
- EP ID EP119019
- DOI -
- Views 121
- Downloads 0
Implementation Of ROCK Clustering Algorithm For The Optimization Of Query Searching Time
Clustering is a data mining technique of grouping similar type of data or queries together which helps in identifying similar subject areas. The major problem is to identify heterogeneous subject areas where frequent que...
A Novel Approach for clustering web user sessions using RST
Web usage mining has assumed importance in learning about web user's behavior and user interactions with the website. It uses data mining techniques to discover non-trivial user behavior patterns. These patterns can then...
An Extensive Evaluation of Anaphora Resolution Based Abstract Generation System
This paper presents an extensive evaluation of anaphora resolution (AR) algorithm proposed for Abstract Generation System (AGS) and discusses the metrics used to measure its performance. The evaluation exercise is conduc...
ANN and Fuzzy Logic Models for the Prediction of groundwater level of a watershed
Computational Intelligence techniques have been proposed as an efficient tool for modeling and forecasting in recent years and in various applications. Groundwater is a highly valuable resource. Measurement and analysis...
Query Optimization on Compressed and Decompressed Object-Oriented Database Using Operators
In this paper, we present an approach using various database operators that permits to enrich technique of query ptimization existing in the objectoriented databases and the comparative analysis of query optimization of...