{"affected":[{"defaultStatus":"unaffected","ecosystem":"hex","packageName":"jose","product":"jose","source":"CNA: EEF","vendor":"potatosalad","versions":[{"lessThan":"1.11.13","status":"affected","version":"1.7.7","versionType":"semver"}]},{"defaultStatus":"unaffected","ecosystem":"github","packageName":"potatosalad/erlang-jose","product":"jose","source":"CNA: EEF","vendor":"potatosalad","versions":[{"lessThan":"bfd336c0062bff93e65d08c22361897e96afd956","status":"affected","version":"d19e1ba68d88c68d29aa942be2573a22dbafca1f","versionType":"git"}]}],"cveId":"CVE-2026-65631","cwes":["CWE-407"],"description":"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.\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.","epss":{"date":"2026-11-03","percentile":0.14457,"score":0.00235},"exploits":[],"kev":null,"metrics":[{"score":6.9,"severity":"medium","source":"CNA: EEF","vector":"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","version":"4.0"}],"modifiedAt":1793727086989,"publishedAt":1793044425204,"references":[{"source":"CNA: EEF","tags":["vendor-advisory","related"],"url":"https://github.com/potatosalad/erlang-jose/security/advisories/GHSA-3m45-vrpj-xmrq"},{"source":"CNA: EEF","tags":["related"],"url":"https://cna.erlef.org/cves/CVE-2026-65631.html"},{"source":"CNA: EEF","tags":["related"],"url":"https://osv.dev/vulnerability/EEF-CVE-2026-65631"},{"source":"CNA: EEF","tags":["related"],"url":"https://github.com/potatosalad/erlang-jose/commit/d19e1ba68d88c68d29aa942be2573a22dbafca1f"},{"source":"CNA: EEF","tags":["patch"],"url":"https://github.com/potatosalad/erlang-jose/commit/bfd336c0062bff93e65d08c22361897e96afd956"}],"remediation":[{"kind":"fix","source":"CNA: EEF","text":"The reporting source identifies this reference as a patch. Check the advisory for affected versions and supported release branches.","url":"https://github.com/potatosalad/erlang-jose/commit/bfd336c0062bff93e65d08c22361897e96afd956"}],"revision":"629f067f27b9fba0545519dd0e51c525e60e536e0346cce140509bf5e619a552","sources":[{"modifiedAt":1793727086989,"name":"CNA: EEF","retrievedAt":1793729435338,"url":"https://www.cve.org/CVERecord?id=CVE-2026-65631"},{"modifiedAt":null,"name":"FIRST EPSS","retrievedAt":1793729438611,"url":"https://api.first.org/data/v1/epss?cve=CVE-2026-65631"}],"ssvc":{"assessedAt":1793726843107,"automatable":"no","exploitation":"poc","source":"ADP: CISA-ADP","technicalImpact":"partial"},"status":"published","title":"erlang-jose RSA JWK parsing attempts to factor an attacker-controlled modulus, enabling CPU-exhaustion denial of service","updatedAt":1793729438611}