The key generation stage of an RSA cipher was based on two prime numbers p= 1063 & q= 1447
a) Use the Euclid’s algorithm to calculate the private key for the public key e = 67
893887
b) Show whether each (e, d) defines a valid pair of public/private keys.
Find the mulpliticative inverse and if it is 1 then the keys are valid
c) If the public key pair (e, n) is (131, 2867), encrypt the following plaintext messages: PRIVATE ENCRYPTION