diff options
| -rw-r--r-- | rsa/key.py | 5 | ||||
| -rw-r--r-- | rsa/prime.py | 6 |
2 files changed, 6 insertions, 5 deletions
@@ -589,10 +589,11 @@ def newkeys(nbits, accurate=True, poolsize=1): import functools getprime_func = functools.partial(parallel.getprime, poolsize=poolsize) - else: getprime_func = rsa.prime.getprime + else: + getprime_func = rsa.prime.getprime # Generate the key components - (p, q, e, d) = gen_keys(nbits, getprime_func) + (p, q, e, d) = gen_keys(nbits, getprime_func, accurate=accurate) # Create the key objects n = p * q diff --git a/rsa/prime.py b/rsa/prime.py index 7422eb1..2e23a2d 100644 --- a/rsa/prime.py +++ b/rsa/prime.py @@ -24,6 +24,7 @@ __all__ = [ 'getprime', 'are_relatively_prime'] import rsa.randnum + def gcd(p, q): '''Returns the greatest common divisor of p and q @@ -32,10 +33,9 @@ def gcd(p, q): ''' while q != 0: - if p < q: (p,q) = (q,p) - (p,q) = (q, p % q) + (p, q) = (q, p % q) return p - + def jacobi(a, b): '''Calculates the value of the Jacobi symbol (a/b) where both a and b are |