diff options
| -rw-r--r-- | lib/Crypto/PublicKey/_slowmath.py | 2 | ||||
| -rw-r--r-- | src/_fastmath.c | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/lib/Crypto/PublicKey/_slowmath.py b/lib/Crypto/PublicKey/_slowmath.py index e9f48f9..1350773 100644 --- a/lib/Crypto/PublicKey/_slowmath.py +++ b/lib/Crypto/PublicKey/_slowmath.py @@ -113,7 +113,7 @@ def rsa_construct(n, e, d=None, p=None, q=None, u=None): # as Factorization", M. Rabin, 1979 spotted = 0 a = 2 - while not spotted and a<100: + while not spotted and a<1000: k = t # Cycle through all values a^{t*2^i}=a^k while k<ktot: diff --git a/src/_fastmath.c b/src/_fastmath.c index c331557..e369f5a 100644 --- a/src/_fastmath.c +++ b/src/_fastmath.c @@ -616,7 +616,7 @@ static int factorize_N_from_D(rsaKey *key) cnt = mpz_scan1(t, 0); mpz_fdiv_q_2exp(t,t,cnt); mpz_set_ui(a, 2); - for (spotted=0; (!spotted) && (mpz_cmp_ui(a,100)<0); mpz_add_ui(a,a,2)) { + for (spotted=0; (!spotted) && (mpz_cmp_ui(a,1000)<0); mpz_add_ui(a,a,2)) { mpz_set(k, t); for (; (mpz_cmp(k,ktot)<0); mpz_mul_ui(k,k,2)) { mpz_powm(cand,a,k,key->n); |