Inefficient Algorithmic Complexity Affecting org.bouncycastle:bcprov-ext-jdk15on package, versions [0,]
Threat Intelligence
The probability is the direct output of the EPSS model, and conveys an overall sense of the threat of exploitation in the wild. The percentile measures the EPSS probability relative to all known EPSS scores. Note: This data is updated daily, relying on the latest available EPSS model version. Check out the EPSS documentation for more details.
Do your applications use this vulnerable package?
In a few clicks we can analyze your entire application and see what components are vulnerable in your application, and suggest you quick fixes.
Test your applications- Snyk IDSNYK-JAVA-ORGBOUNCYCASTLE-18518052
- published4 Aug 2026
- disclosed3 Aug 2026
- creditUnknown
Introduced: 3 Aug 2026
NewCVE-2026-58059 (opens in a new tab)How to fix?
There is no fixed version for org.bouncycastle:bcprov-ext-jdk15on.
Overview
org.bouncycastle:bcprov-ext-jdk15on is a Java implementation of cryptographic algorithms.
Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity in the IETFUtils.valueToString() method, reached through X500Name.toString(), equals(), and hashCode() via AbstractX500NameStyle, which escapes each special character with vBuf.insert(index, "\\") on the same buffer so a value of N escapable bytes costs roughly N²/2 character moves. An attacker can pin a CPU core for seconds to minutes, and saturate the server with a few parallel submissions, by supplying an X.509 certificate, CSR, CRL, or CMS structure containing a single ~60 KB RDN of commas or plus signs. Exploitation only requires a code path that logs, pretty-prints, compares, or hashes the resulting X500Name, including JCA X509Certificate.getSubjectX500Principal().toString() and BC certificate selectors and caches.