diff options
author | Michael Manganiello <mike@fmanganiello.com.ar> | 2016-01-20 20:17:51 -0300 |
---|---|---|
committer | Sybren A. Stüvel <sybren@stuvel.eu> | 2016-01-21 11:12:33 +0100 |
commit | 001ee5d0a87ba48bb547ce2986aabbcd52579d8c (patch) | |
tree | d77f623c82c4168649caec5c467a294fb402c90e /rsa/key.py | |
parent | ebfa910c6a17be5b1ace06ea10d1171ec9dae29a (diff) | |
download | rsa-001ee5d0a87ba48bb547ce2986aabbcd52579d8c.tar.gz |
Corrected accurate mode of 'newkeys' function
Diffstat (limited to 'rsa/key.py')
-rw-r--r-- | rsa/key.py | 6 |
1 files changed, 4 insertions, 2 deletions
@@ -546,6 +546,7 @@ def gen_keys(nbits, getprime_func, accurate=True): return (p, q, e, d) + def newkeys(nbits, accurate=True, poolsize=1): '''Generates public and private keys, and returns them as (pub, priv). @@ -580,10 +581,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 |