Efficient RNS Implementation of Elliptic Curve Point Multiplication Over GF(p)

被引:58
作者
Esmaeildoust, Mohammad [1 ]
Schinianakis, Dimitrios [2 ]
Javashi, Hamid [3 ]
Stouraitis, Thanos [2 ]
Navi, Keivan [1 ]
机构
[1] Shahid Beheshti Univ, Fac Elect & Comp Engn, Tehran 1983963113, Iran
[2] Univ Patras, Dept Elect & Comp Engn, Patras 13231, Greece
[3] Shahid Beheshti Univ, Microelect Lab, Tehran 1983963113, Iran
关键词
Elliptic curve cryptography (ECC); Montgomery multiplication; residue arithmetic; residue number system (RNS); ARCHITECTURE; PROCESSOR;
D O I
10.1109/TVLSI.2012.2210916
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Elliptic curve point multiplication (ECPM) is one of the most critical operations in elliptic curve cryptography. In this brief, a new hardware architecture for ECPM over GF(p) is presented, based on the residue number system (RNS). The proposed architecture encompasses RNS bases with various word-lengths in order to efficiently implement RNS Montgomery multiplication. Two architectures with four and six pipeline stages are presented, targeted on area-efficient and fast RNS Montgomery multiplication designs, respectively. The fast version of the proposed ECPM architecture achieves higher speeds and the area-efficient version achieves better area-delay tradeoffs compared to state-of-the-art implementations.
引用
收藏
页码:1545 / 1549
页数:5
相关论文
共 50 条
[21]   GMC-crypto: Low latency implementation of ECC point multiplication for generic Montgomery curves over GF ( p ) [J].
Javeed, Khalid ;
Shah, Yasir Ali ;
Gregg, David .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2024, 193
[22]   An RNS Implementation of the Elliptic Curve Cryptography for IoT Security [J].
Pandey, Jai Gopal ;
Mitharwal, Chhavi ;
Karmakar, Abhijit .
2019 FIRST IEEE INTERNATIONAL CONFERENCE ON TRUST, PRIVACY AND SECURITY IN INTELLIGENT SYSTEMS AND APPLICATIONS (TPS-ISA 2019), 2019, :66-72
[23]   A High-speed and SPA-resistant Implementation of ECC Point Multiplication over GF(p) [J].
Feng, Xiang ;
Li, Shuguo .
2017 16TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS / 11TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING / 14TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS, 2017, :255-260
[24]   Efficient Lightweight Hardware Structures of Point Multiplication on Binary Edwards Curves for Elliptic Curve Cryptosystems [J].
Rashidi, Bahram ;
Abedini, Mohammad .
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2019, 28 (09)
[25]   An Efficient Multiplier/Divider Design for Elliptic Curve Cryptosystem over GF(2m) [J].
Shieh, Ming-Der ;
Chen, Jun-Hong ;
Lin, Wen-Ching ;
Wu, Chien-Ming .
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2009, 25 (05) :1555-1573
[26]   Highly Area-Efficient Implementation of Modular Multiplication for Elliptic Curve Cryptography [J].
Rahman, Md Sazedur ;
Hossain, Md Selim .
2020 IEEE REGION 10 SYMPOSIUM (TENSYMP) - TECHNOLOGY FOR IMPACTFUL SUSTAINABLE DEVELOPMENT, 2020, :1078-1081
[27]   On Fast Implementations of Elliptic Curve Point Multiplication [J].
Morales, Einstein .
ACMSE 2022: PROCEEDINGS OF THE 2022 ACM SOUTHEAST CONFERENCE, 2022, :173-180
[28]   A High Performance FPGA Implementation of 256-bit Elliptic Curve Cryptography Processor Over GF(p) [J].
Feng, Xiang ;
Li, Shuguo .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (03) :863-869
[29]   Improved Elliptic Curve Cryptographic Processor for General Curves over GF(p) [J].
Chen, Chuanpeng ;
Qin, Zhongping .
2010 IEEE 10TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS (ICSP2010), VOLS I-III, 2010, :1849-+
[30]   Implementation of elliptic curve cryptographic coprocessor over GF(2m) on an FPGA [J].
Okada, S ;
Torii, N ;
Itoh, K ;
Takenaka, M .
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 :25-40