#!/bin/python
import rsa

# Use the notes at ...
# 
# http://www.cs.toronto.edu/~arnold/427/20s/427_20S/RSA/rsa.py
# 
# and especially the functions at the bottom. 
# 
# 1) Find two very large primes, large enough to use for RSA to 
#    encrypt your student number. Hint: look on the web, or use one of my
#    functions, but don't choose primes that are extremely large since
#    they may give the non-efficient functions some issues!
 
p = YOUR_PRIME_GOES_HERE
q = YOUR_PRIME_GOES_HERE
 
# 2) Choose an appropriate e, explain how you know it
#    is a good e? Hint: look at my rsa_keys function
#    cut and paste code here without running rsa_keys,
#    so use egcd instead, take a look at modinv.
 
e = YOUR_ANSWER_GOES_HERE
 
#    Proof that e is good: 
 
YOUR_ANSWER_GOES_HERE (Hint: check it and put the bit of python here)
 
# 3) Find d
 
d = YOUR_ANSWER_GOES_HERE

# 4) How did you find d?

YOUR_ANSWER_GOES_HERE
 
# 5) The public key is 

public_key = 

 
# 6) The private key is 

private_key = 
 

# 7) 

student_num = 

# 8) student_num encrypted with the private key 

student_num_encrypted = 

# 9) student_num_decrypted 

student_num_decrypted =