CVE Professor
›
Back
CVE-2026-99567

CVE-2026-99567 — NONE Vulnerability

NONE CVSS 0 NVD

CVE-2026-99567 is a NONE severity security vulnerability (CVSS 0.0/10) affecting affected software system. Technical vector analysis shows that an attacker can exploit this flaw remotely over the network without authentication (PR:N) with zero user interaction (UI:N), posing a direct security risk to affected deployments.

📄 Official NVD / MITRE Original Record Text

In the Linux kernel, the following vulnerability has been resolved: assoc_array: don't chain a new shortcut onto an existing one When a full node's leaves and the new key all share the node's segment, assoc_array_insert_into_terminal_node() replaces the node with a shortcut to a pair of new nodes. If the node is itself the target of a shortcut, the new shortcut is installed as that shortcut's next node, and a shortcut leading to a shortcut is something nothing expects: assoc_array_walk() indexes the second one as a node, and assoc_array_apply_edit() hits the BUG_ON() in the loop that adjusts nr_leaves_on_branch, on that same insertion. Deletion gets a node there. When the subtree below a shortcut shrinks enough, assoc_array_delete() collapses it into one node below the shortcut, and the leaves it collects can all share that node's segment. The next key that shares it too takes this path. Eighteen insertions and a deletion are enough: sixteen keys that agree on bits 0-11, one that leaves them at bit 8 and is deleted again, and one more that agrees with the sixteen. Have the new shortcut replace the one in front of the node as well. assoc_array_insert_shortcut() gives it that shortcut's back pointer and parent slot, so the caller installs it where that one was, and excises the old shortcut along with the node, which takes a second entry in excised_meta[]. The new shortcut's index key comes from the new key up to the new skip level, so it covers what the old one did. Found by a userspace test doing random insertions and deletions on keys that share long prefixes; a targeted case builds a shortcut, deletes down to the collapse and inserts one more key.

Published 20.11.2026
ISO Date 2026-11-20
Source NVD
AI Security Analysis & Remediation
🤖 Generating Deep AI Security Analysis…
Analyzing CVSS vector & CWE weakness structure…

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
CVE-2026-99567
CVSS 0/10 · UNKNOWN · 20.11.2026
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

🎯 WHAT IS THIS VULNERABILITY?
Summary: In the Linux kernel, the following vulnerability has been resolved:

assoc_array: don't chain a new shortcut onto an existing one

When a full node's leaves and the new key all share the node's segment,
assoc_array_insert_into_terminal_node() replaces the node with a
shortcut to a pair of new nodes. If the node is itself the target of a
shortcut, the new shortcut is installed as that shortcut's…

⚡ ATTACK CHAIN
CVSS vector not available. Review vendor advisory.

🌍 REAL WORLD IMPACT

🛡️ REMEDIATION
→ Apply the vendor-released patch immediately.
→ Add WAF rule, create IDS alert for anomalous traffic.

⚠️ URGENCY
📌 Low priority — routine update sufficient.

────────────────────────────────────────
[Kural Tabanlı Otomatik Güvenlik Analizi]

Target Reconnaissance Queries (FOFA & Shodan)
CVSS Score
0 / 10 · CVSS NONE
References & Advisories (3)
Related CVEs
0.0
CVE-2026-126540
Convert::ASN1 versions before 0.37 for Perl allow CPU exhaustion via quadratic bigint loop in os2ip. Every IN
0.0
CVE-2026-126568
Convert::ASN1 versions before 0.37 for Perl allow memory exhaustion via unbounded MSG_PEEK buffer doubling in
0.0
CVE-2026-126576
Convert::ASN1 versions before 0.37 for Perl allow CPU exhaustion via unchecked exponent length in binary REAL
0.0
CVE-2026-126682
Convert::ASN1 versions before 0.37 for Perl allow CPU exhaustion via exponent-notation string in INTEGER encod
0.0
CVE-2026-126819
Convert::ASN1 versions before 0.37 for Perl allow memory exhaustion via zero-length BIT STRING content. A BIT
0.0
CVE-2026-126956
Convert::ASN1 versions before 0.37 for Perl allow memory exhaustion via unlimited recursion depth in construct