Pastebin

#!/usr/bin/python
from extended_euclid import extended_gcd
#step 1
p = 61
q = 53
#step 2
n = p*q
#step 3
phi = (p-1)*(q-1)

#step 4
#e = 65537 # 2^16+1
e = 17

#step 5
# Use extended euclidian algorithm to compute d to satisfy the congruence relation 
# de = (mod phi(n)) ie: de = 1 + kÃ¸(n) 
# for some integer k
d = stuck?