In the Linux kernel, the following vulnerability has been resolved: crypto: qat - validate RSA CRT component lengths The generic RSA key parser (rsa_helper.c) bounds each CRT component (p, q, dp, dq, qinv) by the modulus size n_sz, but qat_rsa_setkey_crt() allocates half-size DMA buffers (key_sz / 2) and right-aligns each component with: memcpy(dst + half_key_sz - len, src, len) When a CRT component is larger than half_key_sz the subtraction underflows and memcpy writes past the DMA buffer, causing memory corruption. Add a len > half_key_sz check next to the existing !len check for each of the five CRT components so the driver falls back to the non-CRT path instead of writing out of bounds.

A flaw was found in the Linux kernel's QAT (QuickAssist Technology) crypto module. This vulnerability occurs in the RSA key parser when handling CRT (Chinese Remainder Theorem) components. An underflow can happen during a memory copy operation if an RSA CRT component is larger than its allocated buffer, leading to memory corruption. This could potentially allow an attacker to cause system instability or execute arbitrary code.

Red Hat Enterprise Linux 10 Affected kernel Red Hat Enterprise Linux 6 Not affected kernel Red Hat Enterprise Linux 7 Not affected kernel Red Hat Enterprise Linux 7 Not affected kernel-rt Red Hat Enterprise Linux 8 Not affected kernel Red Hat Enterprise Linux 8 Not affected kernel-rt Red Hat Enterprise Linux 9 Affected kernel Red Hat Enterprise Linux 9 Affected kernel-rt https://www.cve.org/CVERecord?id=CVE-2026-64304 https://nvd.nist.gov/vuln/detail/CVE-2026-64304 https://lore.kernel.org/linux-cve-announce/2026072507-CVE-2026-64304-7d9a@gregkh/T