tag | 2ae68571d53cd2b91abbed6d6aa538e4420e5a36 | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Mon Jul 06 15:48:05 2020 -0700 |
object | 0f11f579f8c3a3575c0040d8bcf55cadb43e1591 |
Android 8.0.0 release 48
commit | 0f11f579f8c3a3575c0040d8bcf55cadb43e1591 | [log] [tgz] |
---|---|---|
author | Adam Vartanian <flooey@google.com> | Thu May 10 19:23:41 2018 +0100 |
committer | hamzeh <hamzeh@google.com> | Wed May 16 21:15:20 2018 -0700 |
tree | 2413bab2ece70e5a3d1a134ef1c7c11fb66242c2 | |
parent | cd9ea7ec6305a93cbe247af670a79d27800bffaa [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)