CVE Vulnerabilities

CVE-2026-41292

Inefficient Algorithmic Complexity

Published: May 20, 2026 | Modified: Jun 30, 2026
CVSS 3.x
7.5
HIGH
Source:
NVD
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H
CVSS 2.x
RedHat/V2
RedHat/V3
7.5 IMPORTANT
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H
Ubuntu
MEDIUM
root.io logo minimus.io logo echo.ai logo

NLnet Labs Unbound up to and including version 1.25.0 is vulnerable to a degradation of service attack related to parsing long lists of incoming EDNS options. An adversary sending queries with too many EDNS options can hold Unbound threads hostage while they are parsing and creating internal data structures for the options. Coordinated attacks can result in degradation and/or denial of service. Unbound 1.25.1 contains a patch with a fix to limit acceptable incoming EDNS options (100).

Weakness

An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.

Affected Software

NameVendorStart VersionEnd Version
UnboundNlnetlabs*1.25.1 (excluding)
UnboundUbuntudevel*
UnboundUbuntuesm-infra/bionic*
UnboundUbuntuesm-infra/focal*
UnboundUbuntuesm-infra/xenial*
UnboundUbuntujammy*
UnboundUbuntunoble*
UnboundUbuntuquesting*
UnboundUbunturesolute*

References