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
相关论文
共 50 条
  • [11] Elliptic curve scalar point multiplication using radix-4 booth's algorithm
    Moon, S
    IEEE INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES 2004 (ISCIT 2004), PROCEEDINGS, VOLS 1 AND 2: SMART INFO-MEDIA SYSTEMS, 2004, : 80 - 83
  • [12] Hard problems in elliptic curve scalar multiplication
    Vijayarangan, Natarajan
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2010, 13 (05): : 445 - 452
  • [13] Elliptic Curve Scalar Multiplication with a Bijective Transform
    Nagai, Yoshitaka
    Shirase, Masaaki
    Izu, Tetsuya
    2014 EIGHTH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING (IMIS), 2014, : 280 - 286
  • [14] Atomicity Improvement for Elliptic Curve Scalar Multiplication
    Giraud, Christophe
    Verneuil, Vincent
    SMART CARD RESEARCH AND ADVANCED APPLICATION, PROCEEDINGS, 2010, 6035 : 80 - +
  • [15] Parallel scalar multiplication for elliptic curve cryptosystems
    Ansari, B
    Wu, HP
    2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 71 - 73
  • [16] Overview of Scalar Multiplication in Elliptic Curve Cryptography
    Li, Ye
    Feng, Liu
    2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 2670 - 2673
  • [17] A parallel algorithm for computing simultaneous inversions with application to elliptic curve scalar multiplication
    Sarkar, P
    Mishra, PK
    Barua, R
    PROCEEDINGS OF THE 46TH IEEE INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS & SYSTEMS, VOLS 1-3, 2003, : 782 - 785
  • [18] Optimization algorithm for scalar multiplication in the elliptic curve cryptography over prime field
    Hao, Yuanling
    Ma, Shiwei
    Chen, Guanghua
    Zhang, Xiaoli
    Chen, Hui
    Zeng, Weimin
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS, PROCEEDINGS: WITH ASPECTS OF THEORETICAL AND METHODOLOGICAL ISSUES, 2008, 5226 : 904 - +
  • [19] An Efficient Fault Detection Method for Elliptic Curve Scalar Multiplication Montgomery Algorithm
    Bedoui, Mouna
    Bouallegue, Belgacem
    Hamdi, Belgacem
    Machhout, Mohsen
    2019 IEEE INTERNATIONAL CONFERENCE ON DESIGN & TEST OF INTEGRATED MICRO & NANO-SYSTEMS (DTS), 2019,
  • [20] Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases
    Meloni, Nicolas
    Hasan, M. Anwar
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2009, PROCEEDINGS, 2009, 5747 : 304 - 316
12345