RSA algorithm

RSA is an acronym for (Rivest Shamir and Adleman). Ron Rivest, AdiShamir and Leonard Adleman are quite NB. They invented this algorithm more than 20 years ago and are now widely used.

This is a public key encryption algorithm, encryption and decryption are reciprocal. If the public key is encrypted and the private key is decrypted, the secret communication can be realized; if the private key is encrypted and the public key is decrypted, the digital signature can be realized. Let's talk about the algorithm:

1. First select two large primes p and Q

All must be greater than 10 ^ 100, because small primes are very decomposable.

2. Make n=p*q and z = (pmur1) * (qmer1)

There's nothing to explain this one.

3. Select d, which requires that d and z are mutually prime.

As long as it's a coprime.

4. Select e and require e*d=1 (mod z)

It's annoying to say this mod, where mod means mathematical symbols, not programmatic mod, such as axib (mod c), which means that an and b divide by c, the remainder is the same.

5. Plaintext P is divided into k-bit blocks, which satisfy 2 ^ k.