diff options
author | Sybren A. St?vel <sybren@stuvel.eu> | 2011-07-10 12:40:30 +0200 |
---|---|---|
committer | Sybren A. St?vel <sybren@stuvel.eu> | 2011-07-10 12:40:30 +0200 |
commit | 8588203bcd0c837036a107b1f0163a8bdcfa2e6b (patch) | |
tree | 8b37d21ec3cbe8fa9423ca2fb7d65345da19c674 | |
parent | 3ba3833bd7646aa8c37149e9bb95741eb750fb25 (diff) | |
download | rsa-8588203bcd0c837036a107b1f0163a8bdcfa2e6b.tar.gz |
Changed key creation to use e=65537
-rwxr-xr-x | rsa/keygen.py | 13 |
1 files changed, 4 insertions, 9 deletions
diff --git a/rsa/keygen.py b/rsa/keygen.py index 0ffe58d..d027a30 100755 --- a/rsa/keygen.py +++ b/rsa/keygen.py @@ -61,9 +61,9 @@ def find_p_q(nbits): while True: q = rsa.prime.getprime(qbits) - #Make sure p and q are different. + # Make sure p and q are different. if q != p: break - + return (p, q) def calculate_keys(p, q, nbits): @@ -72,15 +72,10 @@ def calculate_keys(p, q, nbits): """ - n = p * q phi_n = (p-1) * (q-1) - while True: - # Make sure e has enough bits so we ensure "wrapping" through - # modulo n - e = max(65537, rsa.prime.getprime(nbits/4)) - if rsa.prime.are_relatively_prime(e, n) and rsa.prime.are_relatively_prime(e, phi_n): - break + # A very common choice for e is 65537 + e = 65537 (d, i, _) = extended_gcd(e, phi_n) |