rsa.py

from fractions import gcd
from random import randint

def egcd(a, b):
	if a == 0:
		return (b, 0, 1)
	else:
		g, y, x = egcd(b % a, a)
		return (g, x - (b // a) * y, y)

def modinv(a, m):
	g, x, y = egcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

(p, q) = (61, 53) #get the primes however you want
n = p * q
tot = (p - 1) * (q - 1)
e = randint(2, tot - 1)
while gcd(e, tot) != 1:
	e = randint(2, tot - 1)
d = modinv(e, tot)

print (n, e, d)