Abstract:

In order to ensure the online information security of users, the public key cryptosystem is used to encrypt the data information. As the core operation of public key cryptosystem, the computation efficiency of large integer modular multiplication is very important to the performance of public key cryptosystem. In this study, a polynomial expanded cross Montgomery modular multiplication algorithm is proposed, which is based on the classical Montgomery modular multiplication algorithm. By decomposing large bit-width logic operations, and performing modular multiplication and modular reduction operations with polynomial expansion, this algorithm can effectively improve the calculation efficiency of large integer modular multiplication operations, and reduce the resource consumption of hardware implementation. FPGA experiment verification shows that compared with other methods, the proposed algorithm can reduce AT1 and AT2 (the products of area and time) by 96.5% and 69% respectively, indicating that the proposed method achieves the balance between computing time and hardware overhead, has high flexibility and universality, and is suitable for cost-sensitive applications with a large number of encryption requirements.

Key words: Montgomery modular multiplication, modular multiplication of large integer, RSA cryptographic algorithm, public key cryptography algorithm, information security, FPGA, hardware acceleration, software-hardware co-design