SB2026110473 - Inefficient Algorithmic Complexity in fast-xml-parser

CSH
CYBERSECURITY HELP
Sign In REGISTER

Main Vulnerability Database SB2026110473

SB2026110473 - Inefficient Algorithmic Complexity in fast-xml-parser

Published: November 4, 2026

Security Bulletin ID SB2026110473
CSH Severity
Low
Patch available
YES
Number of vulnerabilities 1
Exploitation vector Remote access
Highest impact Partial DoS

Breakdown by Severity

Low 100%
  • Low
  • Medium
  • High
  • Critical

Description

This security bulletin contains information about 1 vulnerability.


1) Inefficient Algorithmic Complexity (CVE-ID: N/A)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: 6.3 [CVSS:4.0/AV:N/AC:L/AT:P/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N]


The vulnerability allows a remote attacker to cause a denial of service through excessive CPU consumption.

The vulnerability exists due to inefficient algorithmic complexity in fast-xml-parser's readStopNodeData() function when processing unterminated tags with the non-default stopNodes option enabled. A remote attacker can submit crafted XML constructed as '<stop>' + '<a '.repeat(n), with stopNodes configured to match the root element and no subsequent '>' character, to trigger repeated scans of the remaining input and quadratic CPU consumption before the parser throws an error.


Remediation

Install update from vendor's website.

References