-
Bug
-
Resolution: Fixed
-
P4
-
8, 11, 15
-
b07
| Issue | Fix Version | Assignee | Priority | Status | Resolution | Resolved In Build |
|---|---|---|---|---|---|---|
| JDK-8267471 | 13.0.8 | Yuri Nesterenko | P4 | Resolved | Fixed | b03 |
| JDK-8303514 | 11.0.20-oracle | Sean Coffey | P4 | Resolved | Fixed | b01 |
| JDK-8253708 | 11.0.10 | Valerie Peng | P4 | Resolved | Fixed | b01 |
When an even value is used for the RSA public exponent e, it is not possible to find a phi(n) that is relatively prime to e. The key generation routine still attempts to find one in an infinite loop. We can fix this by rejecting even values, and/or by exiting the loop after a fixed number of attempts.
- backported by
-
JDK-8253708 Infinite loop in RSA KeyPairGenerator
-
- Resolved
-
-
-
- Resolved
-
-
-
- Resolved
-
