feedc0de/wolfssl
1
0
Fork 0
forked from wolfSSL/wolfssl
Code Pull Requests Activity

RSA-Key Gen Speedup

Browse Source 
1. When doing the test divides on the first few primes, short circuit
out of the loop if the prospective possible prime divides evenly.
This commit is contained in:
John Safranek
2019-07-17 13:43:15 -07:00
parent 8b6e66f095
commit dc71f957f3
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
wolfcrypt/src/tfm.c
View File

@ -3749,8 +3749,10 @@ int mp_prime_is_prime_ex(mp_int* a, int t, int* result, WC_RNG* rng)
/* do trial division */
for (r = 0; r < FP_PRIME_SIZE; r++) {
if (fp_mod_d(a, primes[r], &d) == MP_OKAY) {
if (d == 0)
ret = FP_NO;
if (d == 0) {
*result = FP_NO;
return FP_OKAY;
}
}
else
return FP_VAL;