FPGA Implementation for Elliptic Curve Cryptography Algorithm and Circuit with High Efficiency and Low Delay for IoT Applications

被引：9

作者：

Wang, Deming ^{[1
,2
]}

Lin, Yuhang ^{[3
]}

Hu, Jianguo ^{[2
,4
]}

Zhang, Chong ^{[4
]}

Zhong, Qinghua ^{[1
]}

机构：

[1] South China Normal Univ, Sch Elect & Informat Engn, Foshan 528225, Peoples R China

[2] Dev Res Inst Guangzhou Smart City, Guangzhou 510805, Peoples R China

[3] South China Normal Univ, Sch Phys & Telecommun Engn, Guangzhou 510006, Peoples R China

[4] Sun Yat Sen Univ, Sch Microelect Sci & Technol, Zhuhai 519082, Peoples R China

来源：

MICROMACHINES | 2023年 / 14卷 / 05期

基金：

国家重点研发计划;

关键词：

elliptic curve cryptography (ECC); field-programmable gate array (FPGA); Internet of Things (IoT); point multiplication; Montgomery reduction; AUTHENTICATION; INTERNET;

D O I：

10.3390/mi14051037

中图分类号：

O65 [分析化学];

学科分类号：

070302 ; 081704 ;

摘要：

The Internet of Things requires greater attention to the security and privacy of the network. Compared to other public-key cryptosystems, elliptic curve cryptography can provide better security and lower latency with shorter keys, rendering it more suitable for IoT security. This paper presents a high-efficiency and low-delay elliptic curve cryptographic architecture based on the NIST-p256 prime field for IoT security applications. A modular square unit utilizes a fast partial Montgomery reduction algorithm, demanding just a mere four clock cycles to complete a modular square operation. The modular square unit can be computed simultaneously with the modular multiplication unit, consequently improving the speed of point multiplication operations. Synthesized on the Xilinx Virtex-7 FPGA platform, the proposed architecture completes one PM operation in 0.08 ms using 23.1 k LUTs at 105.3 MHz. These results show significantly better performance compared to that in previous works.

引用

页数：15