RSA is the first algorithm that can be used for data encryption and digital signature. Easy to understand and operate, and very popular. The name of the algorithm is named after the inventors: Ron Livingstone, adi shamir and Leonard Aderman. However, the security of RSA has not been proved theoretically. It has experienced various attacks and has not been completely breached so far.

RSA algorithm is easy to understand and operate. RSA is the most widely studied public key algorithm. It has been nearly twenty years since it was put forward, and it has been gradually accepted by people after being tested by various attacks. It is generally considered as one of the best public key schemes at present. The security of RSA depends on the factorization of large numbers, but it has not been proved theoretically that the difficulty of deciphering RSA is equal to the difficulty of factorization of large numbers.

Extended data:

The public key encryption system allows anyone to encrypt information with a private key when sending it and decrypt it with a public key when receiving it. Of course, the receiver can't be 100% sure of the sender's true identity, but only when the cryptographic system has not been deciphered can it be justified to be sure.

Both sides of data transmission always want to confirm that the message has not been modified during transmission. Encryption makes it very difficult for the third party to read the data, but the third party can still use feasible methods to modify the data during transmission. A popular example is homomorphic attack: in retrospect, it is the same bank above that sends instructions in (A, B) format from its branches to its central management system, where A is the account number and B is the amount in the account.

Baidu Encyclopedia-Digital Signature