Double-core parallel RSA password processing method and coprocessor

Abstract

The present invention relates to the field of information security and microprocessor design, in order to realize the conversion of modular multiplication into simple decimal addition and multiplication through FIOS modular multiplication algorithm, fully reduce the area of ​​modular multiplication operation unit, and effectively avoid writing back a large amount of intermediate data process. From the perspective of hardware implementation, it improves the computational efficiency of the algorithm and further saves computational resources, fundamentally reduces the time and space overhead of encryption and decryption, and effectively improves the encryption and decryption performance of RSA. The technical solution adopted by the present invention is that, before encryption, a dual-core parallel RSA encryption processing method needs to rely on a certificate authority (CA) as a trusted third party to be responsible for the generation, storage, maintenance, and revocation of the user's private key and public key certificate Link, when encrypting, user B executes the operation c=m e (modN) and send the encrypted information c to user A; when decrypting, user A uses his own private key d to perform operations on the ciphertext c to recover the plaintext. The invention is mainly applied to information security processing.

Description

technical field [0001] The invention relates to the fields of information security and microprocessor design, in particular to a design scheme of a dual-core parallel cryptographic coprocessor based on an RSA cryptographic algorithm. Background technique [0002] Public key cryptography, also known as asymmetric cryptography, is currently the main means of ensuring information security. The RSA algorithm is the first public key encryption algorithm that can be used for both encryption and digital signatures. Due to its good security and easy understanding and implementation, it is considered to be one of the most influential public key encryption algorithms at present. The RSA algorithm is based on a very simple mathematical fact: it is very easy to multiply two large prime numbers, but it is extremely difficult to factorize the product, so the product of the two numbers can be disclosed as an encryption key, and the receiver can only use his private key to decrypt. This ...

AI Technical Summary

Problems solved by technology

In order to ensure that the key has a sufficient security level, the key length of the current RSA encryption protocol generally requires 2048 bits or even longer, which limits the calculation speed of the RSA algorithm

The performance of modular exponentiation in RSA mainly depends on the speed of large-number modular multiplication, and the structure is very complex, which cannot meet the increasingly stringent requirements of encryption chips for speed and area.

The powering ladder (Powering Ladder) algorithm is an improvement of the binary modular power algorithm, which has certain parallelism, but also causes a significant increase in the chip area.

Images