RSA is an asymmetric crypto-system, developed in 1978 by Rivest,
Shamir and Adlema. The fundamental idea was to develop a trap-
door function on a set X, meaning that it was to be quite easy for an
individual to generate a set of integers through a function E, but
extremely difficult for another person to do so.
RSA uses a pair of keys to encrypt a plain-text message, into cypher-
text. These keys are the public key, which is known to everyone, and
the private key, which is kept secret by the generator of these keys
(Coffey,2017). In order to communicate, the recipient needs to have
a public key, and a private key. To obtain these, one runs a key
generation algorithm, which generates two large prime numbers, P
and Q. These two numbers are mathematically related. However, it is
computationally infeasible to calculate the other number, given only
one of these. Herein is one of the strengths of RSA.