RSAIntroductionRSA is a public key encryption method, and was first published by Rivest, Shamir and Aldeman in 1977. Using a modulus (\(N\)) it creates a key pair: (e,N) and (d,N). These keys work together, and where we can encrypt with one and decrypt with the other. Often we use it to sign for a message, and where Alice can use her private key (d,N) to encrypt the hash of a message, and then this is proven with her public key (e,N). The modulus (\(N\)) is created by multiplying two prime numbers (\(p\) and \(q\)) and where the strength of the method is based on the difficulty of factorizing the modulus. For this, we determine \(PHI=(p-1)(q-1)\) and where we select \(e\) so that it does not share a factor with PHI. The decryption key value \(d\) is then the inverse of \(e\) mod \(N\).
|