Inefficient Algorithmic Complexity in PUPnP - #VU151942

 

Inefficient Algorithmic Complexity in PUPnP - #VU151942

Published: September 24, 2026


Vulnerability identifier: #VU151942
CSH Severity: Medium
CVSS v4: 8.7 [CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N]
CVE-ID: N/A
CWE-ID: CWE-407
Exploitation vector: Remote access
Exploit availability: No public exploit available

Vulnerability details

The vulnerability allows a remote attacker to cause a denial of service.

The vulnerability exists due to inefficient algorithmic complexity in ixmlParseBufferEx() when parsing crafted well-formed XML in SOAP POST requests. A remote attacker can send a legal-size crafted XML request to cause a denial of service.

The request must target a registered control URL, use the text/xml content type, and include a SOAPACTION header.


Affected software

PUPnP

Remediation

Install security update from vendor's website.

PUPnP - update to 22.1.2

External References

Related Security Bulletins