I need to make a program that does RSA Encryption in python, I am getting p and q from the user, check that p and q are prime. find N using p*q, find phi(n) using (p-1)(q-1). find e where e is coprime with phi(n) and N and 1

output should look roughly like:

public key:

private key:

mod:

phi(n):

msg:

ciphertext: