CVE-2026-42772

Potential CPU DoS via O(n^2) Fragment Reassembly in QUIC

State
Published
Severity
5.3 Medium
Published
Sep 29, 2026
Updated
Sep 30, 2026
Reserved
Apr 29, 2026

Read the record on cve.org

Description

Issue summary: The QUIC stream reassembly algorithm performance deteriorates progressively as packets are arriving out of order. The worst case has a quadratic complexity proportional to the number of stream frames kept in the buffer for the received stream data.

Impact summary: A remote QUIC peer that completes the handshake can create a connection-scoped CPU pressure and potentially a Denial of Service using compliant STREAM frames inside the advertised receive window, with low attacker bandwidth.

CWE: CWE-407: Inefficient Algorithmic Complexity

Description: OpenSSL manages received QUIC stream fragments using a doubly-linked list. While it optimizes for append operations (at the end of the list), it falls back to a head-to-tail linear search for any fragment that does not immediately follow the current `tail`.

By manipulating the sequence of offsets, an attacker can force the server to perform O(n^2) operations, consuming excessive CPU time for the QUIC process.

FIPS impact: no The FIPS module is not affected as the QUIC implementation is outside of the OpenSSL FIPS module boundary.

Scores

CVSSScoreVectorSource
3.15.3 MediumCVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:LCISA-ADP

Weaknesses

  • CWE-407 Inefficient Algorithmic Complexity

Affected Products

ProductVersions
OpenSSLOpenSSL
  • 4.0.0 to before 4.0.3Affected
  • 3.6.0 to before 3.6.5Affected
  • 3.5.0 to before 3.5.9Affected
  • 3.4.0 to before 3.4.8Affected

References

Every record here comes from the CVE Program’s CVE List. © 1999–2026 The MITRE Corporation. CVE is a registered trademark of The MITRE Corporation. The records are reproduced under the CVE Program terms of use.