Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve

被引:0
|
作者
Negre, Christophe [1 ]
Robert, Jean-Marc
机构
[1] Univ Perpignan, Equipe DALI, Perpignan, France
关键词
Elliptic Curve; Parallel Implementation; Scalar Multiplication; Prime Field; Binary Field;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper deals with parallel implementation of scalar multiplication over an elliptic curve. We present parallel approaches which split the scalar into two parts for E (F-p) or three parts for E (F-2m) and perform in parallel the scalar multiplication with each part of the scalar. We present timing results of these approaches implemented over an Intel Core i7 for NIST binary curves B233, B409 and for the twisted Edwards curve Curve25519 (Bernstein, 2006). For the curves B409 and Curve25519 the proposed approaches improve by at least 10% the computation time of the scalar multiplication.
引用
收藏
页码:202 / 209
页数:8
相关论文
共 50 条
  • [21] Hard problems in elliptic curve scalar multiplication
    Vijayarangan, Natarajan
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2010, 13 (05): : 445 - 452
  • [22] 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
  • [23] Improved elliptic curve scalar multiplication algorithm
    Karthikeyan, E.
    Balasubramaniam, P.
    2006 INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2007, : 254 - +
  • [24] Atomicity Improvement for Elliptic Curve Scalar Multiplication
    Giraud, Christophe
    Verneuil, Vincent
    SMART CARD RESEARCH AND ADVANCED APPLICATION, PROCEEDINGS, 2010, 6035 : 80 - +
  • [25] 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
  • [26] 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,
  • [27] Efficient and Secure Elliptic Curve Scalar Multiplication Based on Quadruple-and-Add
    Liu, Shuang-Gen
    An, Si-Jia
    Du, Yi-Wei
    International Journal of Network Security, 2021, 23 (05) : 750 - 757
  • [28] 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 - +
  • [29] 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
  • [30] Highly efficient architecture of elliptic curve scalar multiplication with fault tolerance over GF(2m)
    Zhou, Fang
    Fei, Caixian
    Wu, Ning
    Ge, Fen
    IEICE ELECTRONICS EXPRESS, 2021, 18 (11):