Fast elliptic curve scalar multiplication for resisting against SPA

被引:5
|
作者
Liu, Shuanggen [1 ]
Yao, Huatong [1 ]
Wang, Xu An [2 ]
机构
[1] Xian Univ Posts & Telecommun, Sch Telecommun & Informat Engn, Xian 710121, Shaanxi, Peoples R China
[2] Engn Univ Chinese Armed Police Force, Xian 710078, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
elliptic curve scalar multiplication; simple power analysis; SPA; highest-weight symbolic ternary form; HSTF;
D O I
10.1504/IJCSE.2018.095845
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper analyses the computation of symbolic ternary form (STF) elliptic curve scalar multiplication algorithm and binary scalar multiplication algorithm. Compared with binary scalar multiplication algorithm, the efficiency of STF scalar multiplication algorithm is increased by 5.9% on average and has a corresponding advantage. For this reason, we improve the structure of STF scalar multiplication algorithm and make the performance more 'smooth' by constructing indistinguishable operation between points addition (A) and triple point (T) and thus to resist against the simple power analysis attacks. At the same time, we propose highest-weight symbolic ternary form (HSTF), which makes a scalar k transform into the highest-weight form. Thus, every cycle has a fixed pattern to resist against SPA attack. With respect to binary scalar multiplication algorithm with anti-SPA, the average efficiency in enhanced by 17.7%.
引用
收藏
页码:343 / 352
页数:10
相关论文
共 50 条
  • [21] Low-Latency Elliptic Curve Scalar Multiplication
    Bos, Joppe W.
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2012, 40 (05) : 532 - 550
  • [22] Secure and Compact Elliptic Curve LR Scalar Multiplication
    Jin, Yaoan
    Miyaji, Atsuko
    INFORMATION SECURITY AND PRIVACY, ACISP 2020, 2020, 12248 : 605 - 618
  • [23] Elliptic Curve Scalar Multiplication with x-Coordinate
    ZHANG Ning1
    2. Ministry of Education Key Laboratory of Computer Networks and Information Security
    WuhanUniversityJournalofNaturalSciences, 2007, (01) : 163 - 166
  • [24] Pipelined computation of scalar multiplication in elliptic curve cryptosystems
    Mishra, PK
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2004, PROCEEDINGS, 2004, 3156 : 328 - 342
  • [25] Analysis of Elliptic Curve Scalar Multiplication in Secure Communications
    Thomas, Christina
    Sheela, K. Gnana
    2015 GLOBAL CONFERENCE ON COMMUNICATION TECHNOLOGIES (GCCT), 2015, : 611 - 615
  • [26] Parallelized Software Implementation of Elliptic Curve Scalar Multiplication
    Robert, Jean-Marc
    INFORMATION SECURITY AND CRYPTOLOGY (INSCRYPT 2014), 2015, 8957 : 445 - 462
  • [27] Low-Latency Elliptic Curve Scalar Multiplication
    Joppe W. Bos
    International Journal of Parallel Programming, 2012, 40 : 532 - 550
  • [28] Efficient Elliptic Curve Parallel Scalar Multiplication Methods
    Al-Otaibi, Ahmed
    Al-Somani, Turki F.
    Beckett, Paul
    2013 8TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS (ICCES), 2013, : 116 - 123
  • [29] Improvement of Scalar Multiplication Time for Elliptic Curve Cryptosystems
    Lehsaini, Mohamed
    Feham, Mohammed
    Tabet Hellel, Chifaa
    2013 11TH INTERNATIONAL SYMPOSIUM ON PROGRAMMING AND SYSTEMS (ISPS), 2013, : 53 - 57
  • [30] Efficient and Secure Implementation of Elliptic Curve Scalar Multiplication Against Power Analysis Attacks
    Sudhakar, T.
    Natarajan, V
    Kannathal, A.
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATICS AND ANALYTICS (ICIA' 16), 2016,