My writing is easy to understand, just look at you and you will understand. For example.

An example of RSA algorithm is given.

/lsgo/blog/item/5fd 0 da 24d 495666834 a 80 FB 8 . html

There seems to be an algorithm in space.

I know I just answered another friend's question and posted it for you to see.

/question/9 126 1774 . html？ si=2

Title: When using RSA algorithm to encrypt, the public key is (e=7, n=20) and the private key is (e=3, n=20). When the message M=3 is encrypted with the public key, the ciphertext obtained is _ _ _ _ _?

Give the detailed process. thank you

A:

What you said:

n=20

D=7 public key

E=3 private key

Encryption M=3.

M' = m d% n (m to the power of d, and then divide by n to take the remainder)

M' = 3 7% 20 = 2 187% 20 = 7 after encryption, it is equal to 7.

Decryption M'=7.

M = m 'e% n = 7.3% 20 = 34.3% 20 = 3. After decryption, it became 3 again.

The two prime numbers you take are too small, so n is too small to work at all. Take at least 1024 digits.