eef-cve-2026-65631
CVSS 6.9 osv_hex## Summary 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.
- Published
- unknown
- Last Modified
- unknown
CVSS details not available.
No product information available.
- https://github.com/potatosalad/erlang-jose/security/advisories/GHSA-3m45-vrpj-xmrq
- https://cna.erlef.org/cves/CVE-2026-65631.html
- https://github.com/potatosalad/erlang-jose/commit/d19e1ba68d88c68d29aa942be2573a22dbafca1f
- https://github.com/potatosalad/erlang-jose/commit/bfd336c0062bff93e65d08c22361897e96afd956
- https://hex.pm/packages/jose
No linked vulnerabilities found.
{
"affected": [
{
"database_specific": {
"source": "https://cna.erlef.org/osv/EEF-CVE-2026-65631.json"
},
"package": {
"ecosystem": "Hex",
"name": "jose",
"purl": "pkg:hex/jose"
},
"ranges": [
{
"events": [
{
"introduced": "1.7.7"
},
{
"fixed": "1.11.13"
}
],
"type": "SEMVER"
}
],
"versions": [
"1.10.0",
"1.10.1",
"1.11.0",
"1.11.1",
"1.11.10",
"1.11.11",
"1.11.12",
"1.11.2",
"1.11.4",
"1.11.5",
"1.11.6",
"1.11.7",
"1.11.8",
"1.11.9",
"1.7.7",
"1.7.8",
"1.7.9",
"1.8.0",
"1.8.1",
"1.8.2",
"1.8.3",
"1.8.4",
"1.9.0"
]
},
{
"database_specific": {
"source": "https://cna.erlef.org/osv/EEF-CVE-2026-65631.json"
},
"ranges": [
{
"events": [
{
"introduced": "d19e1ba68d88c68d29aa942be2573a22dbafca1f"
},
{
"fixed": "bfd336c0062bff93e65d08c22361897e96afd956"
}
],
"repo": "https://github.com/potatosalad/erlang-jose",
"type": "GIT"
}
],
"versions": [
"1.11.12",
"1.11.11",
"1.11.10",
"1.11.9",
"1.11.8",
"1.11.7",
"1.11.5",
"1.11.4",
"1.11.2",
"1.11.1",
"1.11.0",
"1.10.1",
"1.10.0",
"1.9.0",
"1.8.4",
"1.8.3",
"1.8.2",
"1.8.1",
"1.8.0",
"1.7.9",
"1.7.8",
"1.7.7"
]
}
],
"aliases": [
"CVE-2026-65631",
"GHSA-3m45-vrpj-xmrq"
],
"credits": [
{
"name": "Peter Ullrich",
"type": "REPORTER"
},
{
"name": "Andrew Bennett",
"type": "REMEDIATION_DEVELOPER"
},
{
"name": "Jonatan Männchen / EEF",
"type": "ANALYST"
}
],
"database_specific": {
"capec_ids": [
"CAPEC-130"
],
"cpe_ids": [
"cpe:2.3:a:potatosalad:jose:*:*:*:*:*:*:*:*"
],
"cwe_ids": [
"CWE-407"
]
},
"details": "## Summary\n\nInefficient 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.\n\nWhen 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.\n\nThis issue affects jose: from 1.7.7 before 1.11.13.",
"id": "EEF-CVE-2026-65631",
"modified": "2026-10-26T20:11:07.682468010Z",
"published": "2026-10-26T19:53:45.204Z",
"references": [
{
"type": "ADVISORY",
"url": "https://github.com/potatosalad/erlang-jose/security/advisories/GHSA-3m45-vrpj-xmrq"
},
{
"type": "WEB",
"url": "https://cna.erlef.org/cves/CVE-2026-65631.html"
},
{
"type": "WEB",
"url": "https://github.com/potatosalad/erlang-jose/commit/d19e1ba68d88c68d29aa942be2573a22dbafca1f"
},
{
"type": "FIX",
"url": "https://github.com/potatosalad/erlang-jose/commit/bfd336c0062bff93e65d08c22361897e96afd956"
},
{
"type": "PACKAGE",
"url": "https://hex.pm/packages/jose"
}
],
"schema_version": "1.9.0",
"severity": [
{
"score": "CVSS:4.0/AV:L/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N",
"type": "CVSS_V4"
}
],
"summary": "erlang-jose RSA JWK parsing attempts to factor an attacker-controlled modulus, enabling CPU-exhaustion denial of service"
}