E2CSM: efficient FPGA implementation of elliptic curve scalar multiplication over generic prime field GF(p)

被引:0
作者
Javeed, Khalid [1 ]
El-Moursy, Ali [1 ]
Gregg, David [2 ]
机构
[1] Univ Sharjah, Dept Comp Engn, Sharjah, U Arab Emirates
[2] Trinity Coll Dublin, Sch Comp Sci, Dublin, Ireland
基金
爱尔兰科学基金会;
关键词
Elliptic curve cryptography; Finite field arithmetic; FPGA; Hardware acceleration; Public key cryptography; CRYPTOGRAPHY PROCESSOR; MODULAR MULTIPLICATION; POINT MULTIPLICATION; ECC PROCESSOR; ARCHITECTURE;
D O I
10.1007/s11227-023-05428-4
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Elliptic curve scalar multiplication (ECSM) is the primitive operation that is also the main computational hurdle in almost all protocols based on elliptic curve cryptography (ECC). This work proposes a novel ECSM hardware architecture by adopting several optimization strategies at circuit and system levels. On the circuit level, it is based on an efficient finite field multiplier that takes fewer clock cycles, produces low latency, and consumes fewer hardware resources. On the system level, Jacobian coordinates with the Montgomery laddering algorithm and a fast scheduling mechanism to execute group operations are adopted. The proposed ECSM design is synthesized and implemented targeting different FPGAs using Xilinx ISE Design Suite. It takes 1.01 ms on the Virtex-7 FPGA to compute a single ECSM operation, occupies 7.1K slices, and achieves 187 MHz frequency. This provides a 30% improvement in computational time with a significantly lower area-time product with better efficiency. Therefore, the proposed ECSM design is better optimized in terms of speed, area-time product, and throughput per slice and hence is suitable for many ECC applications.
引用
收藏
页码:50 / 74
页数:25
相关论文
共 52 条
[1]   Fast Strategies for the Implementation of SIKE Round 3 on ARM Cortex-M4 [J].
Anastasova, Mila ;
Azarderakhsh, Reza ;
Kermani, Mehran Mozaffari .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2021, 68 (10) :4129-4141
[2]   High-throughput multi-key elliptic curve cryptosystem based on residue number system [J].
Asif, Shahzad ;
Hossain, Md Selim ;
Kong, Yinan .
IET COMPUTERS AND DIGITAL TECHNIQUES, 2017, 11 (05) :165-172
[3]   High-Speed and Unified ECC Processor for Generic Weierstrass Curves over GF(p) on FPGA [J].
Awaludin, Asep Muhamad ;
Larasati, Harashta Tatimma ;
Kim, Howon .
SENSORS, 2021, 21 (04) :1-20
[4]  
Azarderakhsh R., 2017, Submission NIST Post-Quantum Standardization Project, V152, P154
[5]  
Bernstein DJ, 2008, LECT NOTES COMPUT SC, V5023, P389
[6]  
Bernstein DJ, 2007, LECT NOTES COMPUT SC, V4833, P29
[7]  
Bernstein Daniel J., 2013, Safecurves: choosing safe curves for ellipticcurve cryptography
[8]  
BLAKLEY GR, 1983, IEEE T COMPUT, V32, P497, DOI 10.1109/TC.1983.1676262
[9]   Elliptic Curve Cryptography in Practice [J].
Bos, Joppe W. ;
Halderman, J. Alex ;
Heninger, Nadia ;
Moore, Jonathan ;
Naehrig, Michael ;
Wustrow, Eric .
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2014, 2014, 8437 :157-175
[10]  
Cohen H., 2005, Handbook of Elliptic and Hyperelliptic Curve Cryptography, DOI DOI 10.1201/9781420034981