After studying Diffie and Hellman’s 1976 paper describing the public-key cryptography problem and their initial solution, three researchers at MIT began searching for an improved approach. After several months, they found a very flexible technique that performs asymmetric encryption and decryption. It is called RSA after the researchers: Ron Rivest, Adi Shamir, and Len Adleman. The basic technique, like Diffie–Hellman, uses modular exponentiation.
RSA public and private keys consist of pairs of numbers. Each contains two of the following:
N—the modulus, part of both RSA key pairs
e—the public exponent, part of the RSA public key
d—e’s modular inverse, the secret part of the private key
There is no g, as there ...