Vol 10 Chapter 2109: A performance

"In fact, a one-way trapdoor function for exponential power operation is constructed, and the ciphertext C=M^emodn is obtained by calculating the plaintext M."
"But it is difficult to calculate the base M from the ciphertext C, the exponent e, and the base M. Unless you know the trapdoor information d."
"..."
With eloquence, Martin Hellman talked about the most important things.
The expressions of the people also changed from blank faces to surprise, to a sudden realization.
There is a saying, the fool is only one teacher away from the genius...
When Martin Hellman led the crowd into the door, everyone suddenly felt a sense of cheerfulness.
It turns out that public key cryptography is not as difficult as imagined.
And the source of this difficulty comes from the threshold!
Yes it is the threshold.
Every profession, every subject has a threshold.
There is an easy-to-understand term for this threshold, called "entry".
The people sitting here are all top talents from major universities or major research institutes.
The knowledge contained in their heads is connected, enough to circle the earth twice.
The reason why they find it difficult to face public key cryptography is because they have not crossed the threshold!
Sometimes, to solve a problem is actually very simple, just need to catch the fleeting white dove.
It's just trying to catch him, but it's extremely difficult.
And now, Martin Hellman sent the white dove to everyone.
There is no reason to refuse...
On the stage, the corner of Martin Hellman's mouth was raised, and a faint smile appeared on his face as he watched everyone's suddenly realized expressions.
To be honest, he is very happy, very happy.
Because this is the essence of science.
This is the original intention of his invention of public key encryption technology.
He wants this technology to be known to more people and used by more people.
The corner of Martin Hellman's mouth raised slightly, and he said slowly: "We just talked about the algorithm architecture, now let's talk about the addition technology..."
"Encryption technology, as the name suggests, is to encrypt the program, [Encryption] c=m^emodn, RSA is a block cipher, for a certain n, the plaintext message is converted into binary data and divided into data packets smaller than n."
"[Decrypted] Proof:
c^dmodn=m
c^dmodn=(m^emodn)^dmodn
=(m^(ed)modn^d)modn
=m^(kΦ(n)+1)modn
"..."
=m^(kΦ(n))mmodn (Extension of Fermat's Little Theorem Euler)
=1mmodn
=m"
Each group of ciphertext after decryption is the result of modulo n operation, so it is also a number less than n. But each group of ciphertext is calculated to have indefinite digits. The n-bits can be filled with 0-filling method. "
"..."
Quiet!
Deathly quiet...
Listening to Martin Hellman talking on the podium, the hall was silent.
At this moment, a monstrous wave has been set off in their hearts.
They wanted to exclaim.
But the only remaining example tells them that they can't!
Because doing so is likely to disrupt MartinHellman's thinking!
So they can only desperately suppress the huge waves in their hearts, force a calm expression, and quietly listen to Martin Hellman's report.