https://db.gcve.eu Contains only the most 10 recent entries. http://www.rssboard.org/rss-specification python-feedgen en Thu, 01 Oct 2026 15:53:02 +0000 https://db.gcve.eu/vuln/certfr-2026-avi-1241 certfr-2026-avi-1241 https://db.gcve.eu/vuln/certfr-2026-avi-1241 https://db.gcve.eu/vuln/fkie_cve-2026-42772 <p>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.</p> <p>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.</p> <p>CWE: CWE-407: Inefficient Algorithmic Complexity</p> <p>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`.</p> <p>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.</p> <p>FIPS impact: no The FIPS module is not affected as the QUIC implementation is outside of the OpenSSL FIPS module boundary.</p> <p>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.</p> <p>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.</p> <p>CWE: CWE-407: Inefficient Algorithmic Complexity</p> <p>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`.</p> <p>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.</p> <p>FIPS impact: no The FIPS module is not affected as the QUIC implementation is outside of the OpenSSL FIPS module boundary.</p> https://db.gcve.eu/vuln/fkie_cve-2026-42772 https://db.gcve.eu/vuln/ghsa-5r49-x3jp-qp9h <p>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.</p> <p>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.</p> <p>CWE: CWE-407: Inefficient Algorithmic Complexity</p> <p>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`.</p> <p>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.</p> <p>FIPS impact: no The FIPS module is not affected as the QUIC implementation is outside of the OpenSSL FIPS module boundary.</p> <p>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.</p> <p>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.</p> <p>CWE: CWE-407: Inefficient Algorithmic Complexity</p> <p>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`.</p> <p>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.</p> <p>FIPS impact: no The FIPS module is not affected as the QUIC implementation is outside of the OpenSSL FIPS module boundary.</p> https://db.gcve.eu/vuln/ghsa-5r49-x3jp-qp9h https://db.gcve.eu/vuln/rhsa-2026:74162 <p>openssl: openssl: Denial of Service via excessive memory allocation in CRL distribution point processing openssl: openssl: Traffic amplification Denial of Service via QUIC packet over-accounting openssl: openssl: Denial of Service via inefficient QUIC stream reassembly openssl: OpenSSL: Private key recovery via timing side-channel in generic elliptic curve operations openssl: openssl: Denial of Service via excessive QUIC packet buffer retention openssl: openssl: information disclosure via non-constant-time SM2 scalar multiplication on ARM64 and RISC-V openssl: openssl: Denial of Service via out-of-bounds write during TLS context switch openssl: OpenSSL: Denial of Service via unenforced QUIC connection flow control openssl: openssl: Denial of Service via crafted CMP certificate revocation response openssl: OpenSSL: Denial of Service via undersized DTLS record openssl: OpenSSL: Private key recovery via SM2 timing side-channel openssl: compat-openssl: openssl: Information disclosure via DTLS handshake retransmission openssl: OpenSSL: Denial of Service via unbounded QUIC connection identifier backlog</p> <p>openssl: openssl: Denial of Service via excessive memory allocation in CRL distribution point processing openssl: openssl: Traffic amplification Denial of Service via QUIC packet over-accounting openssl: openssl: Denial of Service via inefficient QUIC stream reassembly openssl: OpenSSL: Private key recovery via timing side-channel in generic elliptic curve operations openssl: openssl: Denial of Service via excessive QUIC packet buffer retention openssl: openssl: information disclosure via non-constant-time SM2 scalar multiplication on ARM64 and RISC-V openssl: openssl: Denial of Service via out-of-bounds write during TLS context switch openssl: OpenSSL: Denial of Service via unenforced QUIC connection flow control openssl: openssl: Denial of Service via crafted CMP certificate revocation response openssl: OpenSSL: Denial of Service via undersized DTLS record openssl: OpenSSL: Private key recovery via SM2 timing side-channel openssl: compat-openssl: openssl: Information disclosure via DTLS handshake retransmission openssl: OpenSSL: Denial of Service via unbounded QUIC connection identifier backlog</p> https://db.gcve.eu/vuln/rhsa-2026:74162 https://db.gcve.eu/vuln/ubuntu-cve-2026-42772 <p><strong>Affected:</strong> Ubuntu:Pro:22.04:LTS: nodejs, Ubuntu:26.04:LTS: edk2, Ubuntu:26.04:LTS: edk2-hwe, Ubuntu:26.04:LTS: openssl</p> <p>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.</p> <p><strong>Affected:</strong> Ubuntu:Pro:22.04:LTS: nodejs, Ubuntu:26.04:LTS: edk2, Ubuntu:26.04:LTS: edk2-hwe, Ubuntu:26.04:LTS: openssl</p> <p>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.</p> https://db.gcve.eu/vuln/ubuntu-cve-2026-42772