A worked example
The public key is (n = 5183, e = 8609).
The private key is (n = 5183, d = 209).
m= 127 to encrypt
c =
127^8609 mod 5183
c =
2324
to decrypt c = 2324
2324 ^8609 mod 5183 = 3748
3748 ^8609 mod 5183 = 123
123 ^8609 mod 5183 = 2257
2257^8609 mod 5183 = 3247
3247^8609 mod 5183 = 127
127 ^8609 mod 5183 = 2324
Now we have successfully decrypted c with m = 127
Take any number c ( rsa encrypted message) You can continue encrypting
process (with rsa function )
no matter what number c you start with, you will always eventually
reach
m the decrypted message.
plez visit
https://docs.google.com/document/d/1sTHB52526LQW3YnU39HdZ49pXIlQKOXGAsm3oIdUELM/edit?hl=en#
--
You received this message because you are subscribed to the "Crypto++ Users"
Google Group.
To unsubscribe, send an email to [email protected].
More information about Crypto++ and this group is available at
http://www.cryptopp.com.
