Fast Montgomery modular multiplier operation optimization method suitable for national cryptographic sm2p256v1 algorithm

Abstract

The invention discloses a fast Montgomery modular multiplier operation optimization method suitable for a national cryptographic sm2p256v1 algorithm. The method is realized through a Montgomery modular multiplier in an information security chip. After the Montgomery modular multiplier carries out initialization operation, a large number multiplication operation is completed, then one time of cyclic accumulation calculation is carried out, and finally one time of unsigned large number subtraction operation is carried out to obtain a result. Time-consuming multiplication operation in Montgomerymodular multiplication is greatly reduced, so that the operation efficiency of the Montgomery modular multiplier when the information security chip operates the sm2p256v1 curve parameters is improved,and the power consumption in the same operation process is reduced.

Description

technical field [0001] The invention relates to a modular multiplication algorithm used in the field of information security, in particular to a fast Montgomery modular multiplier operation optimization method suitable for the national secret sm2p256v1 algorithm. Background technique [0002] When the information security chip performs national secret calculations, the Montgomery modular multiplier is the most frequently called and most time-consuming module. Although the general algorithm can adapt to any national secret curve parameters, the recommended curve sm2p256v1 for the national secret that has an absolute advantage in use frequency, The existing information security chip uses a nested loop calculation method, which increases the time complexity, makes the system performance poor, and the chip consumes a lot of power. Contents of the invention [0003] The purpose of the present invention is to greatly reduce the time-consuming multiplication of the Montgomery mod...

AI Technical Summary

Problems solved by technology

[0002] When the information security chip performs national secret calculations, the Montgomery modular multiplier is the most frequently called and most time-consuming module. Although the general algorithm can adapt to any national secret curve parameters, the recommended curve sm2p256v1 for the national secret that has an absolute advantage in use frequency, The existing information security chip uses a nested loop calculation method, which increases the time complexity, makes the system performance poor, and the chip consumes a lot of power

Images