Parallel scalar multiplication for elliptic curve cryptosystems

被引：0
|
作者：
Ansari, B [1 ]
Wu, HP [1 ]
机构：
[1] Univ Waterloo, Dept ECE, Waterloo, ON N2L 3G1, Canada
来源：
2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS | 2005年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this paper, a parallel elliptic curve scalar multiplication algorithm is proposed. The algorithm works at its highest efficiency when a dual-processor hardware system is utilized. The new method has an average computation time of n/3 times of that of one elliptic curve addition (ECADD) on an n-bit scalar. The saving is n elliptic curve doublings (ECDBLs) compared to the standard (single processor) methods. When the ratio of the execution time of a point addition to that of a point doubling is 3, the proposed method is 90% faster than the standard method.
引用
收藏
页码：71 / 73
页数：3
相关论文
共 50 条
  • [1] Elliptic Curve Cryptosystems and Scalar Multiplication
    Constantinescu, Nicolae
    [J]. ANNALS OF THE UNIVERSITY OF CRAIOVA-MATHEMATICS AND COMPUTER SCIENCE SERIES, 2010, 37 (01): : 27 - 34
  • [2] Fast and scalable parallel processing of scalar multiplication in elliptic curve cryptosystems
    Wu, Keke
    Li, Huiyun
    Zhu, Dingju
    [J]. SECURITY AND COMMUNICATION NETWORKS, 2012, 5 (06) : 648 - 657
  • [3] Fast sequential and parallel algorithms for computing scalar multiplication in elliptic curve cryptosystems
    Zhong, Cheng
    Shi, Runhua
    Ge, Lina
    Li, Zhi
    [J]. DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 50 - 53
  • [4] Improvement of Scalar Multiplication Time for Elliptic Curve Cryptosystems
    Lehsaini, Mohamed
    Feham, Mohammed
    Tabet Hellel, Chifaa
    [J]. 2013 11TH INTERNATIONAL SYMPOSIUM ON PROGRAMMING AND SYSTEMS (ISPS), 2013, : 53 - 57
  • [5] Pipelined computation of scalar multiplication in elliptic curve cryptosystems
    Mishra, PK
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2004, PROCEEDINGS, 2004, 3156 : 328 - 342
  • [6] Faster Scalar Multiplication for Elliptic Curve Cryptosystems (Extended Abstract)
    Sakemi, Yumi
    Izu, Tetsuya
    Shirase, Masaaki
    [J]. 2013 16TH INTERNATIONAL CONFERENCE ON NETWORK-BASED INFORMATION SYSTEMS (NBIS 2013), 2013, : 523 - 527
  • [7] Scalar point multiplication using redundant recoding in elliptic curve cryptosystems
    Moon, S
    [J]. 2004: 7TH INTERNATIONAL CONFERENCE ON SOLID-STATE AND INTEGRATED CIRCUITS TECHNOLOGY, VOLS 1- 3, PROCEEDINGS, 2004, : 2063 - 2066
  • [8] Pipelined computation of scalar multiplication in elliptic curve cryptosystems (extended version)
    Mishra, Pradeep Kumar
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (08) : 1000 - 1010
  • [9] Efficient Elliptic Curve Parallel Scalar Multiplication Methods
    Al-Otaibi, Ahmed
    Al-Somani, Turki F.
    Beckett, Paul
    [J]. 2013 8TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS (ICCES), 2013, : 116 - 123
  • [10] Two new fast methods for simultaneous scalar multiplication in elliptic curve cryptosystems
    Shi, RH
    Cheng, JX
    [J]. NETWORKING AND MOBILE COMPUTING, PROCEEDINGS, 2005, 3619 : 462 - 470
12345