CVE-2026-31641: rxrpc: Fix RxGK token loading to check bounds
In the Linux kernel, the following vulnerability has been resolved:
rxrpc: Fix RxGK token loading to check bounds
rxrpc_preparse_xdr_yfs_rxgk() reads the raw key length and ticket length
from the XDR token as u32 values and passes each through round_up(x, 4)
before using the rounded value for validation and allocation. When the raw
length is >= 0xfffffffd, round_up() wraps to 0, so the bounds check and
kzalloc both use 0 while the subsequent memcpy still copies the original
~4 GiB value, producing a heap buffer overflow reachable from an
unprivileged add_key() call.
Fix this by:
(1) Rejecting raw key lengths above AFSTOKEN_GK_KEY_MAX and raw ticket
lengths above AFSTOKEN_GK_TOKEN_MAX before rounding, consistent with
the caps that the RxKAD path already enforces via AFSTOKEN_RK_TIX_MAX.
(2) Sizing the flexible-array allocation from the validated raw key
length via struct_size_t() instead of the rounded value.
(3) Caching the raw lengths so that the later field assignments and
memcpy calls do not re-read from the token, eliminating a class of
TOCTOU re-parse.
The control path (valid token with lengths within bounds) is unaffected.
Security readout for executives and security teams
Plain-English summary
A local, low-privileged Linux user could submit a malicious RxGK authentication token that triggers a kernel heap overflow. Successful exploitation could crash the system or potentially compromise kernel-level confidentiality and integrity. Network access and user interaction are not required, but an attacker must already be able to run code locally.
Executive priority
Treat as a high-priority local privilege-boundary issue. Accelerate remediation on shared servers, developer platforms, container hosts, and other systems permitting untrusted local workloads. Internet-facing status alone does not determine exposure because the attack path is local. Follow normal expedited kernel maintenance unless vendor analysis marks the deployed build unaffected.
Technical view
RxGK token parsing rounds attacker-controlled 32-bit key or ticket lengths before validation. Values at or above 0xfffffffd can wrap the rounded length to zero, causing undersized allocation followed by an approximately 4 GiB memcpy. The correction validates raw lengths before rounding, sizes allocation from the validated key length, and caches parsed lengths to prevent re-reading.
Likely exposure
Exposure is limited to Linux kernels containing the vulnerable RxGK parser and systems where an unprivileged user can reach it through add_key(). The bundle identifies affected Linux releases including 6.16, 6.18.23, 6.19.13, and 7.0, but its version data is ambiguous; confirm exact distribution status with the vendor.
Exploitation context
The supplied CVSS 3.1 score is 7.8: local access, low complexity, low privileges, no user interaction, and potentially high confidentiality, integrity, and availability impact. The CVE is not listed as KEV, and the supplied sources provide no evidence of active exploitation or a public exploit.
Researcher notes
The core defect is integer wraparound during four-byte alignment, followed by inconsistent use of rounded and raw lengths. The source describes a heap overflow from an unprivileged key-management call, but does not establish exploit reliability or a specific privilege-escalation outcome. The stated correction also removes a token re-parse concern by caching validated lengths.
Mitigation direction
Apply a vendor kernel update containing the referenced bounds-checking correction.
Use applicable Red Hat security advisories for affected Red Hat systems.
Prioritize multi-user and workload-hosting systems where unprivileged local code can run.
Check vendor guidance before applying compensating controls if immediate kernel updates are unavailable.
Validation and detection
Inventory deployed kernel versions and compare them with distribution-specific CVE status.
Verify updated kernels include an applicable referenced stable-kernel correction.
Confirm systems booted into the updated kernel after maintenance.
Determine whether the deployed kernel contains the vulnerable RxGK token parser.
Record exceptions where vendor version status remains ambiguous or unavailable.
Generated from the cited source records. This long-tail analysis has not been individually reviewed by a named human.
Potential ATT&CK relevance
Conservative CVE-to-ATT&CK context
These mappings and lookup hints may be relevant to the vulnerability behavior, CWE, affected product, or exposure path. Glexia-inferred context is not an official MITRE, ATT&CK, CWE, or CVE Program mapping.
ATT&CK lookup starting points
Use these exact CWE pages and searches to review the Glexia ATT&CK library from this CVE's weakness and description context.
cwe · low confidence lookup
CWE-190: Exact CWE lookup
Use the exact CWE identifier as the starting point before reviewing related ATT&CK behavior. Open the exact CWE lookup page first, then review the ATT&CK searches from that MITRE weakness context. This is a Glexia lookup hint, not an official ATT&CK mapping.
The CVE wording references authentication or credential exposure, so valid-account and credential-access review may help. This is a Glexia inferred lookup path, not an official MITRE, ATT&CK, or CVE Program mapping.
These fields come from the CVE record and ADP containers, not from Glexia's Take. They preserve time-varying source decisions such as CISA SSVC, KEV status, CVSS metrics, and provider references.
2CVSS vectors
5Timeline events
1ADP providers
9Source links
CVSS vector scores
2 official scores
We collect every scored CVSS vector available in the official CNA and ADP containers. When more than one version is present, the table keeps the source vectors side by side instead of collapsing them into the highest score.
CWE links open Glexia weakness intelligence pages with official CWE context, developer remediation guidance, and related CVE mappings.
CWE-190 · source CWE mapping
Integer Overflow or Wraparound
Integer Overflow or Wraparound represents a recurring weakness pattern that can create exploitable paths when design, validation, or implementation controls are missing.