Montgomery modular multiplication-based data processing method

Abstract

The invention discloses a Montgomery modular multiplication-based data processing method and belongs to the technical field of computers. The method comprises the following steps of: initializing a fifth random access memory through a central processing unit (CPU), and executing the following operations on the contents in a second random access memory by taking words as units, namely (1) calling a multiplying and adding module to multiply one word of the contents of the second random access memory and contents of a first random access memory and add the product with the contents of the fifth random access memory; (2) extracting one word from an operation result of the step (1) and multiplying the word with the contents of a constant register, and writing the low-order word of the multiplied result into a fourth register; and (3) calling the multiplying and adding module to multiply the contents of the fourth register with the contents of the third random access memory and add the product with the contents of the fifth random access memory; and finally, outputting the contents of the fifth random access memory according to the contents of the third memory.

Description

technical field [0001] The invention belongs to the technical field of computers, and in particular relates to a data processing method based on Montgomery modular multiplication. Background technique [0002] Among the current hardware implementations of large integer modular multiplication algorithms, the Montgomery modular multiplication algorithm is considered to be the most efficient and most suitable for hardware implementation. [0003] At present, the Montgomery algorithm and its variants are mostly used in the design of modular multipliers that realize modular multiplication of large integers. The existing modular multipliers are designed to store intermediate results and read them when needed in the next cycle. The storage device performs frequent reading and writing, and the reading and writing of the storage device takes clock cycles, which affects the working efficiency of the modular multiplier and reduces the data processing rate based on the Montgomery modula...

AI Technical Summary

Problems solved by technology

[0003] At present, the design of modular multipliers that realize the modular multiplication of large integers mostly uses the Montgomery algorithm and its variants. The existing modular multipliers are designed to store intermediate results and read them when they are needed in the next cycle. The storage device performs frequent reading and writing, and the reading and writing of the storage device takes clock cycles, which affects the working efficiency of the modular multiplier and reduces the data processing rate based on Montgomery modular multiplication, such as the existing Montgomery algorithm. The defect of slow operation speed in hardware implementation will lead to low efficiency and low speed of encryption algorithms such as RSA and ECC

Images