Method for processing RSA password based on residue number system and coprocessor

Abstract

The invention relates to information technology security and microprocessor design. Aiming at increasing RSA (Ron Rivest, Adi Shamirh and LenAdleman) modular multiplication operation speed and improving RSA encryption and decryption performances, the invention provides the technical scheme as follows: a method for processing an RSA password based on a residue number system comprises the followingsteps of performs encryption and decryption operations by using an RSA algorithm and performing large-number modular exponentiation of the RSA algorithm by using an L-R (Left-Right) binary scanning modular power algorithm; an improved Montgomery algorithm is specifically as follows: 1024-bit large numbers with are expressed as numbers under the residue number system, namely two sets of 33 32-bit decimal numbers and one 32-bit number expressed under a redundancy base; an expression process is a mould solving process; the decomposed 32-bit decimal numbers respectively participate in 32-bit modular multiplication, modular multiplication accumulation and modular addition operation independently; furthermore, 32-bit data performs parallel execution operation without dependence; and the method disclosed by the invention is mainly applicable for the information technology security and microprocessor design.

Description

technical field [0001] The present invention relates to information technology security and microprocessor design. Specifically, it relates to an RSA cryptographic coprocessor based on a remainder system. Background technique [0002] The RSA public key encryption algorithm was developed in 1977 by Ron Rivest, Adi Shamirh and Len Adleman (MIT, USA). RSA takes its name from the names of the three who developed them. [0003] With the development of computer network and information technology, information security is playing an increasingly important role in various fields, among which cryptography has become the core of information security technology. RSA is currently recognized as the most mature and perfect public key cryptosystem in theory and practical application. It is based on the difficulty of factoring large integers to ensure the security of RSA algorithm. At present, most encryption and digital signatures using public key cryptography use the RSA algorithm. ...

AI Technical Summary

Problems solved by technology

The algorithm of the RSA cryptosystem is not complicated, but it relies on the modular exponentiation operation of long integers, and it is difficult to obtain a relatively high degree of data processing

Images