CVE-2026-65631 Affecting erlang-jose package, versions *
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-DEBIAN13-ERLANGJOSE-21757305
- published28 Oct 2026
- disclosed26 Oct 2026
Introduced: 26 Oct 2026
NewCVE-2026-65631 (opens in a new tab)How to fix?
There is no fixed version for Debian:13 erlang-jose.
NVD Description
Note: Versions mentioned in the description apply only to the upstream erlang-jose package and not the erlang-jose package as distributed by Debian.
See How to fix? for Debian:13 relevant fixed versions and status.
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.
References
- https://security-tracker.debian.org/tracker/CVE-2026-65631
- https://cna.erlef.org/cves/CVE-2026-65631.html
- https://github.com/potatosalad/erlang-jose/commit/bfd336c0062bff93e65d08c22361897e96afd956
- https://github.com/potatosalad/erlang-jose/commit/d19e1ba68d88c68d29aa942be2573a22dbafca1f
- https://github.com/potatosalad/erlang-jose/security/advisories/GHSA-3m45-vrpj-xmrq
- https://osv.dev/vulnerability/EEF-CVE-2026-65631