v10 Chapter 2109： A performance (2/2)

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)

=1*mmodn

=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.