diff options
author | Michael Manganiello <mike@fmanganiello.com.ar> | 2016-01-20 20:17:51 -0300 |
---|---|---|
committer | Michael Manganiello <mike@fmanganiello.com.ar> | 2016-01-20 20:17:51 -0300 |
commit | d00a06b99a0e62ea4f63b93102633a91cd86c08a (patch) | |
tree | 7fbbf21b812ffda11af26e1f572dd3703ca84f8f /rsa | |
parent | 29d202d869e96e50637f9bb1a96703e169c560f7 (diff) | |
download | rsa-d00a06b99a0e62ea4f63b93102633a91cd86c08a.tar.gz |
Corrected accurate mode of 'newkeys' function
Diffstat (limited to 'rsa')
-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 |