Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM

被引:0
|
作者
Anagreh, Mohammad [1 ,2 ]
Vainikko, Eero [1 ]
Laud, Peeter [2 ]
机构
[1] Univ Tartu, Inst Comp Sci, J Liivi 2, Tartu, Estonia
[2] Cybernetica, Maealuse 2-1, Tallinn, Estonia
关键词
ECC; Parallel Computing; CRT; DRM;
D O I
10.5220/0009129501760184
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we study the parallel implementations of elliptic curve scalar multiplication over prime fields using signed binary representations. Our implementation speeds up the calculation of scalar multiplication in comparison with the standard case. We introduce parallel algorithms for computing elliptic curve scalar multiplication based on representing the scalar by the Complementary Recoding Technique (CRT) and the Direct Recording Method (DRM). Both implementations of the proposed algorithms show speed-ups reaching up to 60% in comparison with execution time for sequential cases of the algorithms. We find that ECC-DRM is faster than ECC-CRT in both parallel and sequential counterparts.
引用
收藏
页码:176 / 184
页数:9
相关论文
共 50 条
  • [1] SPEEDING UP REGULAR ELLIPTIC CURVE SCALAR MULTIPLICATION WITHOUT PRECOMPUTATION
    Kim, Kwang Ho
    Choe, Junyop
    Kim, Song Yun
    Kim, Namsu
    Hong, Sekung
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2020, 14 (04) : 703 - 726
  • [2] Speeding up elliptic scalar multiplication with precomputation
    Lim, CH
    Hwang, HS
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC'99, 2000, 1787 : 102 - 119
  • [3] Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form
    Al Saffar, Najlae Falah Hameed
    Said, Mohamad Rushdan Md
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2015, 18 (06): : 801 - 821
  • [4] Speeding up elliptic scalar multiplication using multidoubling
    Sakai, Y
    Sakurai, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2002, E85A (05) : 1075 - 1083
  • [5] Pipelined computation of scalar multiplication in elliptic curve cryptosystems
    Mishra, PK
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2004, PROCEEDINGS, 2004, 3156 : 328 - 342
  • [6] Speeding up the Elliptic Curve Scalar Multiplication Using the Window- w Non Adjacent Form
    Al Saffar, Najlae Falah Hameed
    Said, Mohamad Rushdan Md
    MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES, 2015, 9 (01): : 91 - 110
  • [7] Speeding scalar multiplication of elliptic curve over GF(2mn)
    Yong, Ding
    Hong, Yin-Fang
    Wang, Wei-Tao
    Zhou, Yuan-Yuan
    Zhao, Xiao-Yang
    International Journal of Network Security, 2010, 11 (02) : 70 - 77
  • [8] Pipelined computation of scalar multiplication in elliptic curve cryptosystems (extended version)
    Mishra, Pradeep Kumar
    IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (08) : 1000 - 1010
  • [9] Elliptic Curve Cryptosystems and Scalar Multiplication
    Constantinescu, Nicolae
    ANNALS OF THE UNIVERSITY OF CRAIOVA-MATHEMATICS AND COMPUTER SCIENCE SERIES, 2010, 37 (01): : 27 - 34
  • [10] Scalar multiplication in elliptic curve libraries
    Alimoradi, Reza
    Arkian, Hamid Reza
    Razavian, Seiied-Mohammad-Javad
    Ramzi, Ali
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2021, 24 (03): : 657 - 666