| Title | Research in Fast Modular Exponentiation Algorithm Based on FPGA |
| Publication Type | Conference Paper |
| Year of Publication | 2019 |
| Authors | Li, Shu, Tian, Jianwei, Zhu, Hongyu, Tian, Zheng, Qiao, Hong, Li, Xi, Liu, Jie |
| Conference Name | 2019 11th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA) |
| Keywords | Automation, Conferences, Erbium, exponentiation, fast modular exponentiation algorithm, field programmable gate arrays, FPGA, frequency 170.0 MHz, logic design, Mechatronics, modular exponentiation, modular exponentiation on large number, Modular Multiplication, Montgomery algorithm, Montgomery modular multiplication, pubcrawl, public key cryptography, public-key algorithm, public-key cryptography, public-key cryptosystem, Q measurement, resilience, Resiliency, Scalability, systolic array, systolic arrays |
| Abstract | Modular exponentiation of large number is widely applied in public-key cryptosystem, also the bottleneck in the computation of public-key algorithm. Modular multiplication is the key calculation in modular exponentiation. An improved Montgomery algorithm is utilized to achieve modular multiplication and converted into systolic array to increase the running frequency. A high efficiency fast modular exponentiation structure is developed to bring the best out of the modular multiplication module and enhance the ability of defending timing attacks and power attacks. For 1024-bit key operands, the design can be run at 170MHz and finish a modular exponentiation in 4,402,374 clock cycles. |
| DOI | 10.1109/ICMTMA.2019.00024 |
| Citation Key | li_research_2019 |
Research in Fast Modular Exponentiation Algorithm Based on FPGA