With given the two-prime number of p and q we would say p = 3 and
q = 11. We would calculate that n = pq because n would be the
modulars for public and private keys. With that being said we can say
that n = 3*11 = 33. Breaking down this process further we would then
calculate the totient phi (p - 1)(q - 1) and phi (n) = (3-1)*(11 -1) = 2*10 =
20. Now with choosing an integer we say e because it is a public key so e
= 3. With a secret key given by initial d which would be from the
following formula of: e*d = 1 (mod 20). This would consequently imply
that the value of d is divided by 20 yields 1 as a reminder. Therefore we
are left with d = 7. Now to find the encrypted message number we would
say ^e (mod n) and that the decrypted message number = that
of encrypted message number ^d (mod n).
