Basic Public key Encryption steps

The basic public key cryptography steps were presented by Whitfield Diffie and Martin Hellman in 1976.

Mathematical concept:

A "prime number" is a positive integer that can only be divisible by 1 and itself (except for the remainder of 0).

The first 8 prime numbers are 1, 2, 3, 5, 7, 11, 13, 17

Any positive integer that is not a prime number can be converted to a product of more than two prime numbers and is the only combination.

4=2*2

6=2*3

8=2*4=2*2*2

10=2*5

12=2*6=2*2*3

"Facts":

In mathematics, it is easy to multiply two large numbers. It is not so easy to find the mass factor of a positive integer.

If you give the number 35 and tell you that it is the product of two prime numbers, you can simply find out that the two prime numbers are 5 and 7. But if I told you 1588522601 too, you might spend a lot of time (or CPU cycles) finding out that it was 49811*31891. When this number is really big, the job becomes "impossible in Time". So now I'm going to give you a large number of two prime numbers, and I can guarantee that no one else will know except me.

This is the implementation method for today's public key authentication (pkc–public key cryptography). For example, I tell everyone a number, and someone will use him to encrypt the data to me. Each can see the data after the encryption, but I am the only one who knows how to decrypt the shortcut. Other people have to break down that big number before they can read the message, and in fact it's an impossible task to accomplish in a short time.