CVE-2026-65631

Name of the Vulnerable Software and Affected Versions erlang-jose versions 1.7.7 through 1.11.12

Description Inefficient algorithmic complexity allows an unauthenticated remote attacker to cause a CPU-exhaustion denial of service by submitting a crafted RSA JSON Web Key (JWK). When an application parses an untrusted JWK through the 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 providing d, e, and n but omitting Chinese Remainder Theorem parameters (p, q, dp, dq, qi) is processed by convert sfm to crt/1. This function attempts to recover missing primes by factoring the modulus, which is read from base64url input without validation. If the modulus cannot be split into two factors, the convert sfm to crt find p/6 search loop performs continuous modular exponentiation, consuming significant CPU resources. Flooding the system with such requests can saturate all schedulers and deny service.

Recommendations Update erlang-jose to version 1.11.13 or later.