ZDF
Sign inSign up

Vulnerabilities

Vulnerability · CVE-2026-65631

Inefficient Algorithmic Complexity in erlang-jose allows an unauthenticated remote attacker to cause a CPU-exhaustion denial of service by submitting a crafted RSA JSON Web Key.

Published Oct 26, 2026 · catalog updated Oct 27, 2026 · Inefficient Algorithmic Complexity in

Last checked Nov 5, 2026. A connected source was read within the last 7 days.

Check if you run it

No confirmed exploitation is on record for CVE-2026-65631. EPSS is 0.24%. Act only if a listed version of Inefficient Algorithmic Complexity in is installed.

Gaps on this record

  • The stored product name is a package slug. The name on this page is taken from the title (Inefficient Algorithmic Complexity in).
  • No vendor fix or required action is stored. Compare the linked advisory before you change production.
Severity
Unknown—
Known exploitation
Not in CISA/VulnCheck KEV
EPSS
0.24%
Remediation
Advisory link
Affected products
Debian:12 erlang-jose · Debian:13 erlang-jose · Debian:14 erlang-jose · Hex jose

Inefficient Algorithmic Complexity in erlang-jose allows an unauthenticated remote attacker to cause a CPU-exhaustion denial of service by submitting a crafted RSA JSON Web Key. When an application parses an untrusted JWK through the public jose_jwk:from_binary/1 or jose_jwk:from_map/1 API (or the Elixir wrappers JOSE.JWK.from_binary/1 and JOSE.JWK.from_map/1), an RSA private key that supplies d, e, and n but omits all Chinese Remainder Theorem parameters (p, q, dp, dq, qi) is routed into convert_sfm_to_crt/1, which tries to recover the missing primes by factoring the modulus. The three integers are read straight from the base64url input and are never validated as a real RSA key. When the modulus cannot be split into two factors (for example, when it is itself prime), the search loop convert_sfm_to_crt_find_p/6 performs a modular exponentiation over the attacker-sized modulus on every iteration and never succeeds. A single request of a few hundred bytes forces close to one CPU-second of work before an internal one-second watchdog kills the worker, and a larger modulus raises the cost further. By flooding such requests an attacker can saturate every scheduler and deny service, without credentials, a valid RSA key, or any special configuration. This issue affects jose: from 1.7.7 before 1.11.13.

Are you affected?

Enter the version you run. The result uses only the ranges stored on this record.

The check returns affected, not affected, or incomplete. It does not guess a version that is missing from the record.

  • Debian:12 erlang-jose1.11.10-1, 1.11.10-1~bpo12+1, 1.11.12-1
  • Debian:13 erlang-jose1.11.10-1, 1.11.12-1, 1.11.12-1.1
  • Debian:14 erlang-jose1.11.10-1, 1.11.12-1, 1.11.12-1.1
  • Hex jose1.7.7 → 1.11.13

How to fix CVE-2026-65631

What to do

Three questions, each answered from this record only. Confirm the vendor advisory before you patch.

Should you patch?

No confirmed exploitation is on record for CVE-2026-65631. EPSS is 0.24%. Act only if a listed version of Inefficient Algorithmic Complexity in is installed.

Which versions are affected?

Compare what you have installed with 1.11.10-1, 1.11.10-1~bpo12+1, 1.11.12-1, 1.11.10-1, 1.11.12-1, 1.11.12-1.1, 1.7.7 → 1.11.13. Compare the installed version with the linked vendor advisory before you change production.

What should an analyst verify?

CWE-407. EPSS 0.24%. There is no CISA KEV listing. No Exploit-DB or Metasploit reference is linked. Use the source links for the original advisory.

Technology hubs

Debian security

Code

The project this record applies to. Exploit listings stay in References.

Timeline

Detection, updates, and resolution for this record.

  1. Oct 26, 2026 · GitHub Advisory Database

    Fix available

    jose fixed in 1.11.13

  2. Oct 26, 2026 · Trivy Vulnerability DB

    Detected

    Inefficient Algorithmic Complexity in erlang-jose allows an unauthenticated remote attacker to cause a CPU-exhaustion denial of service by submitting a crafted RSA JSON Web Key. When an application parses an untrusted JWK through the public jose_jwk:from_binary/1 or jose_jwk:from_map/1 API (or the Elixir wrappers JOSE.JWK.from_binary/1 and JOSE.JWK.from_map/1), an RSA private key that supplies d,

  3. Oct 27, 2026 · GitHub Advisory Database

    Fix available

    jose fixed in 1.11.13

  4. Oct 27, 2026 · Trivy Vulnerability DB

    Updated

    Inefficient Algorithmic Complexity in erlang-jose allows an unauthenticated remote attacker to cause a CPU-exhaustion denial of service by submitting a crafted RSA JSON Web Key. When an application parses an untrusted JWK through the public jose_jwk:from_binary/1 or jose_jwk:from_map/1 API (or the Elixir wrappers JOSE.JWK.from_binary/1 and JOSE.JWK.from_map/1), an RSA private key that supplies d,

Sources

  • CVE.orgVulnerability recordCVE-2026-65631

    Official CVE identifier

    cve.org
  • GitHub Advisory DatabasePackage advisoryGHSA-3m45-vrpj-xmrq

    GitHub Advisory Database record mirrored by OSV.

    github.com
  • OpenSSF OSV / OSV ScannerPackage advisoryEEF-CVE-2026-65631

    erlang-jose RSA JWK parsing attempts to factor an attacker-controlled modulus, enabling CPU-exhaustion denial of service

    osv.dev
  • Trivy Vulnerability DBPackage advisoryDEBIAN-CVE-2026-65631

    Inefficient Algorithmic Complexity in erlang-jose allows an unauthenticated remote attacker to cause a CPU-exhaustion denial of service by submitting a crafted RSA JSON Web Key. When an application parses an untrusted JWK through the public jose_jwk:from_binary/1 or jose_jwk:from

    osv.dev

References

Freshness

Last verified in this catalog Nov 5, 2026. Significant claims (KEV, EPSS, CVSS, affected ranges) come from the source rows above — open the original publisher for the authoritative advisory.

  • GitHub Advisory DatabaseOct 28, 2026
  • OpenSSF OSV / OSV ScannerOct 28, 2026
  • CVE.orgOct 27, 2026
  • Trivy Vulnerability DBOct 27, 2026