RSA uses the following equation to produce ciphertext:
C = Pe mod n
This means that plaintext P is raised to e number of times and then reduced to modulo n. Decryption in RSA is provided in the following equation:
P = Cd mod n
This means that the receiver who has a public key pair (n, e) can decipher the data by raising C to the value of the private key d and reducing to modulo n.
Get Mastering Blockchain - Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.
Start your free trial Become a member now