2006•Unpublished venueRequires access

Improved Elliptic Curve Scalar Multiplication Algorithm

E. Karthikeyan, P. Balasubramaniam

Abstract

Scalar multiplication is the time consuming operation in elliptic curve based cryptosystem. In this paper, we extend the Shamir method to improve the speed of the scalar multiplication. Instead of non-adjacent form of integers, width-mutual opposite form of the same is used for the computation. The results we obtained from the proposed method significantly improve the performance of the elliptic curve exponentiation.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Scalar multiplication, Elliptic curve point multiplication, Hessian form of an elliptic curve, Elliptic curve cryptography, Exponentiation, Elliptic Curve Digital Signature Algorithm, Elliptic curve, Schoof's algorithm