To write a program to implement the RSA encryption algorithm.ALGORITHM:

STEP$-1$: Select two co$-$prime numbers as $p$ and $q.$

STEP$-2$: Compute $n$ as the product of $p$ and $q.$

STEP$-3$: Compute $)$ and store it in $z.$

STEP$-4$: Select a random prime number e that is less than that of $z.$

STEP$-5$: Compute the private key, $d$ as e $**mo{d}^{-1}(z).$

STEP$-6$: The cipher text is computed as message ${?}^{**}$ mod $n.$

STEP$-7$: Decryption is done as cipher ${?}^d$ mod $n.$