b2eaeb0b8b
This is helpful at smaller sizes because the benefits of an unlikely hit by trival-division are smaller. The full set of kPrimes eliminates about 94.3% of random numbers. The first quarter eliminates about 93.2% of them. But the little extra power of the full set seems to be borderline for RSA 3072 and clearly positive for RSA 4096. Did 316 RSA 2048 key-gen operations in 30035598us (10.5 ops/sec) min: 19423us, median: 80448us, max: 394265us Change-Id: Iee53f721329674ae7a08fabd85b4f645c24e119d Reviewed-on: https://boringssl-review.googlesource.com/26944 Commit-Queue: David Benjamin <davidben@google.com> CQ-Verified: CQ bot account: commit-bot@chromium.org <commit-bot@chromium.org> Reviewed-by: David Benjamin <davidben@google.com> |
||
---|---|---|
.. | ||
asm | ||
add.c | ||
bn_test_to_fuzzer.go | ||
bn_test.cc | ||
bn_tests.txt | ||
bn.c | ||
bytes.c | ||
check_bn_tests.go | ||
cmp.c | ||
ctx.c | ||
div.c | ||
exponentiation.c | ||
gcd.c | ||
generic.c | ||
internal.h | ||
jacobi.c | ||
montgomery_inv.c | ||
montgomery.c | ||
mul.c | ||
prime.c | ||
random.c | ||
rsaz_exp.c | ||
rsaz_exp.h | ||
shift.c | ||
sqrt.c |