Remember, e should be an integer such that, 1 0 & e.compareTo(PHI) < 0) Once we have selected the numbers, we need to calculate the value of n and Ø. We’ll first select two prime numbers P and Q, where P should not be equal to Q. So, we need to calculate a private key and a public key for the implementation of RSA. The term “Asymmetric” signifies that there are two keys public (known to all) and private (only at the receiver).

RSA works on the fact that it is very hard to factorize large numbers (order of 100+ digits). RSA is an asymmetric cryptographic algorithm which is used for encryption purposes so that only the required sources should know the text and no third party should be allowed to decrypt the text as it is encrypted. The term RSA is an acronym for Rivest-Shamir-Adleman who brought out the algorithm in 1977.