Montgomery modular multiplication device and embedded security chip with same

Abstract

The invention provides a Montgomery modular multiplication device and an embedded security chip. The Montgomery modular multiplication device comprises a first Montgomery modular multiplication module, a power calculation module and a second Montgomery modular multiplication module, wherein the first Montgomery modular multiplication module is used for obtaining a first operation result A according to two first preset parameters, the power calculation module is used for obtaining a second operation result B according to the first operation result A output by the first Montgomery modular multiplication module, the first preset parameter, the second preset parameter and a power calculation function, the first Montgomery modular multiplication module is further used for obtaining a Montgomery modular multiplication conversion coefficient according to the first operation result A and the second operation result B, and the second Montgomery modular multiplication module is used for obtaining a final modular multiplication result according to a first input parameter NA, a second input parameter NB and the Montgomery modular multiplication conversion coefficient. By means of the Montgomery modular multiplication device and the embedded security chip, conversion coefficient calculation through a large modular power multiplication mode can be avoided, the coefficient does not need to be calculated in advance, and the memory space can be saved.

Description

technical field [0001] The invention relates to the field of asymmetric key algorithms in cryptography, in particular to a Montgomery modular multiplication device and an embedded security chip with the same. Background technique [0002] The security guarantee of information security is based on security algorithms, and one type of security algorithms is asymmetric key algorithm. The basic operation of the asymmetric key algorithm is the modular multiplication operation of large numbers. Among the modular multiplication algorithms, the algorithm with high efficiency and easy implementation is the Montgomery modular multiplication algorithm. In the process of using Montgomery modular multiplication, ordinary numbers need to be converted into Montgomery numbers, and then the Montgomery modular multiplication operation is performed according to the coefficients. In the conversion process, conversion coefficients are required. The conversion coefficients are generally calculate...

AI Technical Summary

Problems solved by technology

In the process of using Montgomery modular multiplication, ordinary numbers need to be converted into Montgomery numbers, and then the Montgomery modular multiplication operation is performed according to the coefficients. In the conversion process, conversion coefficients are required. The conversion coefficients are generally calculated by the large number modular power algorithm, so that the current Some embedded security chips need to perform complex large number calculations, so the algorithms in the embedded security chip need to spend more running time and resources

Images