tag | 60e5914e1055b83c40f11bc55c39278c3709ba6a | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Mon Aug 05 13:31:07 2019 -0700 |
object | 5e2f817315d573596a68d2eeb197a3e79cffb1b5 |
Android 7.1.2 Release 37 (5650810)
commit | 5e2f817315d573596a68d2eeb197a3e79cffb1b5 | [log] [tgz] |
---|---|---|
author | Adam Vartanian <flooey@google.com> | Thu May 10 19:23:41 2018 +0100 |
committer | hamzeh <hamzeh@google.com> | Thu May 17 08:01:49 2018 -0700 |
tree | 1ab210c954baaf637e070d092ea8e619eadfc2ad | |
parent | c2727c35a0a865cb64e7d9b9d9aeda4de058a443 [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)