Optimization of reconfigurable SM2 algorithm over prime filed
Aiming at the problems of inefficient of software, low utilization of hardware resources and poor scalability of SM2 algorithm, a reconfigurable optimization method of SM2 algorithm over prime filed was proposed.Through in-depth analysis of the SM2 algorithm, starting from different computation stag...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2022-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022043/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539952325689344 |
|---|---|
| author | Bin LI Qinglei ZHOU Xiaojie CHEN Feng FENG |
| author_facet | Bin LI Qinglei ZHOU Xiaojie CHEN Feng FENG |
| author_sort | Bin LI |
| collection | DOAJ |
| description | Aiming at the problems of inefficient of software, low utilization of hardware resources and poor scalability of SM2 algorithm, a reconfigurable optimization method of SM2 algorithm over prime filed was proposed.Through in-depth analysis of the SM2 algorithm, starting from different computation stages and characteristics, respectively using KOA fast multiplication, fast modular reduction and Barrett algorithm to achieve recommended or arbitrary parameters of the modular multiplication operation, and the radix-4 extended Euclidean algorithm was optimized and improved to accelerate the modular inverse operation.Then, in the standard projective coordinate system, the Montgomery method was used to improve the efficiency of point multiplication, and the data flow of point addition and double point was optimized to shorten the operation cycle to 12 clocks.At the same time, fast coordinate system conversion was realized inside the FPGA.Finally, the parallel scheduling management of multi-SM2 was designed and implemented to meet the computational requirements of multiple applications.The experimental results show that the optimized SM2 makes full use of FPGA resources and shortens the cycle of point multiplication.The maximum number of calculations per second is 352.48 times higher than the CPU (Intel i5-8300), which improves the performance and scalability. |
| format | Article |
| id | doaj-art-0313dc02b5c24e218ac9fd150d184f0d |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2022-03-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-0313dc02b5c24e218ac9fd150d184f0d2025-01-14T06:29:05ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2022-03-0143304159392762Optimization of reconfigurable SM2 algorithm over prime filedBin LIQinglei ZHOUXiaojie CHENFeng FENGAiming at the problems of inefficient of software, low utilization of hardware resources and poor scalability of SM2 algorithm, a reconfigurable optimization method of SM2 algorithm over prime filed was proposed.Through in-depth analysis of the SM2 algorithm, starting from different computation stages and characteristics, respectively using KOA fast multiplication, fast modular reduction and Barrett algorithm to achieve recommended or arbitrary parameters of the modular multiplication operation, and the radix-4 extended Euclidean algorithm was optimized and improved to accelerate the modular inverse operation.Then, in the standard projective coordinate system, the Montgomery method was used to improve the efficiency of point multiplication, and the data flow of point addition and double point was optimized to shorten the operation cycle to 12 clocks.At the same time, fast coordinate system conversion was realized inside the FPGA.Finally, the parallel scheduling management of multi-SM2 was designed and implemented to meet the computational requirements of multiple applications.The experimental results show that the optimized SM2 makes full use of FPGA resources and shortens the cycle of point multiplication.The maximum number of calculations per second is 352.48 times higher than the CPU (Intel i5-8300), which improves the performance and scalability.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022043/reconfigurableSM2FPGAMontgomery point multiplicationfast modular multiplication |
| spellingShingle | Bin LI Qinglei ZHOU Xiaojie CHEN Feng FENG Optimization of reconfigurable SM2 algorithm over prime filed Tongxin xuebao reconfigurable SM2 FPGA Montgomery point multiplication fast modular multiplication |
| title | Optimization of reconfigurable SM2 algorithm over prime filed |
| title_full | Optimization of reconfigurable SM2 algorithm over prime filed |
| title_fullStr | Optimization of reconfigurable SM2 algorithm over prime filed |
| title_full_unstemmed | Optimization of reconfigurable SM2 algorithm over prime filed |
| title_short | Optimization of reconfigurable SM2 algorithm over prime filed |
| title_sort | optimization of reconfigurable sm2 algorithm over prime filed |
| topic | reconfigurable SM2 FPGA Montgomery point multiplication fast modular multiplication |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022043/ |
| work_keys_str_mv | AT binli optimizationofreconfigurablesm2algorithmoverprimefiled AT qingleizhou optimizationofreconfigurablesm2algorithmoverprimefiled AT xiaojiechen optimizationofreconfigurablesm2algorithmoverprimefiled AT fengfeng optimizationofreconfigurablesm2algorithmoverprimefiled |