Skip to main content

Inefficient Algorithmic Complexity in org.bouncycastle:bc-fips

CVE-2026-58059

  • org.bouncycastle:bc-fips
  • org.bouncycastle:bcpg-lts8on
  • org.bouncycastle:bcprov-jdk18on
High
8.7/10

Summary

In Bouncy Castle for Java prior to 1.85, Quadratic-time escaping when stringifying X.500 distinguished names. This issue also affects Bouncy Castle for Java LTS prior to 2.73.12, and Bouncy Castle for Java FIPS (BC-FJA) prior to bc-fips 1.0.2.7 (1.0.X series), 2.0.2 (2.0.X series) and 2.1.3 (2.1.X series).

  • LOW
  • NETWORK
  • NONE
  • UNCHANGED
  • NONE
  • NONE
  • NONE
  • HIGH

CWE-407 - Inefficient Algorithmic Complexity

An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.

References

Advisory Timeline

  • Published