Elliptic curve scalar multiplication algorithm using complementary recoding

被引：23

作者：

Balasubramaniam, P.

Karthikeyan, E. ^{[1
]}

机构：

[1] Gandhigram Rural Univ, Dept Comp Sci & Applicat, Dindigul 624302, Tamil Nadu, India

[2] Gandhigram Rural Univ, Dept Math, Dindigual 624302, Tamil Nadu, India

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2007年 / 190卷 / 01期

关键词：

cryptography; signed binary method; complement recoding; window method; scalar multiplication;

D O I：

10.1016/j.amc.2007.01.015

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Elliptic curve based cryptosystem is an efficient public key cryptosystem, which is more suitable for limited environments. The very expensive operation in elliptic curve based cryptographic protocol is the scalar multiplication. In this paper, scalar multiplication using complementary recoding method is proposed. The intermediate operations carried out in conversion are less than the other existing scalar multiplication algorithm. The efficiency of our proposed method is tested and found that our method is an efficient than the other methods. (C) 2007 Elsevier Inc. All rights reserved.

引用

页码：51 / 56

页数：6

共 14 条

[1]

[Anonymous], 2000, 1363 IEEE

[2] A SIGNED BINARY MULTIPLICATION TECHNIQUE [J].