print"n = p * q =",bcolors.DRED,p,bcolors.ENDC,"*",bcolors.DRED,q,bcolors.ENDC,"=",bcolors.BLUE,n,bcolors.ENDC
print"n = p * q =",bcolors.DRED,p,bcolors.ENDC,"*",bcolors.DRED,q,bcolors.ENDC,"=", \
bcolors.BLUE,n,bcolors.ENDC
print
print
@ -99,7 +100,9 @@ print
# 4. Choose an integer e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1; i.e., e and φ(n) are coprime.
# 4. Choose an integer e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1; i.e., e and φ(n) are coprime.
print"4. looking for an integer e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1; i.e., e and φ(n) are coprime ..."
print"4. looking for an integer e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1; i.e., e and φ(n) are coprime ..."
print"\nSetting e = 2^16+1 (65537) as per recommendation in\nDan Boneh's Twenty Years of Attacks on the RSA Cryptosystem - http://crypto.stanford.edu/~dabo/pubs/papers/RSA-survey.pdf\n"
print"\nSetting e = 2^16+1 (65537) as per recommendation in\n"+ \
"Dan Boneh's Twenty Years of Attacks on the RSA Cryptosystem - "+ \