Rapid Montgomery modular multiplier optimization component suitable for national cryptographic sm2p256v1 algorithm

Abstract

The invention discloses a rapid Montgomery modular multiplier optimization component suitable for a national cryptographic sm2p256v1 algorithm. The component includes a large number multiplier, a temporary variable producer, a cyclic carry accumulator and a large number subtracter. A large integer A and a large integer B with the bit width of 256 bit are input and processed by the large number multiplier to obtain a large integer Z with the bit width of 512 bit. Temporary variables X1 and X2 are generated through Z, and then the temporary variables X1 and X2 and Z are subjected to carry accumulation operation for eight times. A result Z obtained by carry accumulation of each time is used as an input of the carry accumulator and the temporary variable generator, if Z is greater than or equal to a large integer constant M after eight carry accumulation operations are completed, a large number subtraction operation is performed on M and Z once, otherwise, directly a result of eight timesof the cyclic carry accumulator is output.

Description

Technical field [0001] The present invention relates to the field of information security, in particular to a fast Montgomery modular multiplier optimization component suitable for the national secret sm2p256v1 algorithm. Background technique [0002] When the information security chip performs the national secret calculation, the Montgomery modular multiplier is the most time-consuming module with the highest calling frequency. Although the general algorithm can be adapted to any curve parameter, the national secret recommended curve sm2p256v1, which has an absolute advantage in frequency of use, is used. The loop calculation method has high time complexity, high hardware design complexity and high power consumption. Summary of the invention [0003] The purpose of the present invention is to greatly reduce the multiplier resources, reduce the design complexity of the Montgomery modular multiplier, reduce the hardware power consumption, and design a fast Montgomery modular multip...

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 curve parameters, for the national secret recommended curve sm2p256v1, which has an absolute advantage in use frequency, use the embedding The calculation method of sets of loops has high time complexity, high hardware design complexity, and high power consumption

Images