Final changes

crypto.py

@@ -11,6 +11,7 @@ def isPrime(n):
             return False
     return True
 
+# The following block of code is partially referenced from pseudocode from user448810 on https://stackoverflow.com/questions/23279208/calculate-d-from-n-e-p-q-in-rsa
 # Modified Extended Euclidean Algorithm to find modular inverse of e
 def modularInverse(e, r):
     a, b, u = 0, r, 1