tree fb6d5862dee9500d224df0c19bcab0ec9f771a20
parent 431e767c23a238378e7300525075c2d24cd5c73b
author David Benjamin <davidben@google.com> 1509737076 -0400
committer CQ bot account: commit-bot@chromium.org <commit-bot@chromium.org> 1509737851 +0000

Use a higher iteration limit for RSA key generation at e = 3.

Generating a 2048-bit RSA key with e = 3 (don't do this), the failure
rate at 5*bits iterations appears to be around 7 failures in 1000 tries.
Bump the limit up to 32*bits. This should give a failure rate of around
2 failures in 10^14 tries.

(The FIPS 186-4 algorithm is meant for saner values of e, like 65537. e
= 3 implies a restrictive GCD requirement: the primes must both be 2 mod
3.)

Change-Id: Icd373f61e2eb90df5afaff9a0fc2b2fbb6ec3f0a
Reviewed-on: https://boringssl-review.googlesource.com/22584
Commit-Queue: David Benjamin <davidben@google.com>
Commit-Queue: Adam Langley <agl@google.com>
Reviewed-by: Adam Langley <agl@google.com>
CQ-Verified: CQ bot account: commit-bot@chromium.org <commit-bot@chromium.org>