tag | 313ebec760486bbbde51e1c38c1cdcacc4506e54 | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Thu Jul 08 11:26:29 2021 -0700 |
object | 4175a7da9276e53f088707177d3e8f0a0c8f348e |
Android security 8.1.0 release 90
commit | 4175a7da9276e53f088707177d3e8f0a0c8f348e | [log] [tgz] |
---|---|---|
author | Adam Vartanian <flooey@google.com> | Thu May 10 19:23:41 2018 +0100 |
committer | hamzeh <hamzeh@google.com> | Tue May 15 17:38:43 2018 -0700 |
tree | 2446dc5923cb60182ada970b62b788fdc4789235 | |
parent | ebf50b6ec1ab2e6a6927f9590b63429ecc5dd0f8 [diff] |
Fix probable prime confidence calculations. This fix from upstream fixes a problem where the number of iterations used to confirm that a number is prime was based off the length of the key rather than the length of the factors p and q. Fewer iterations are called for for a longer number, so this resulted in a lower-than-expected confidence in the primality of the key factors. This only affects apps that use RSAKeyPairGenerator directly (which is not a public API), rather than those that use java.security.KeyPairGenerator. Upstream commits: https://github.com/bcgit/bc-java/commit/73780ac522b7795fc165630aba8d5f5729acc839 https://github.com/bcgit/bc-java/commit/22467b6e8fe19717ecdf201c0cf91bacf04a55ad Bug: 79148652 Test: make Change-Id: I759a226afc9dbd948611eed99ad89ab7f59b09f8 (cherry picked from commit 91719e3c1be2eb206a50a49a5d172884d65eba1c)