Inefficient Algorithmic Complexity Affecting cairosvg package, versions [,2.9.1)
Threat Intelligence
Snyk has a proof-of-concept or detailed explanation of how to exploit this vulnerability.
The probability is the direct output of the EPSS model, and conveys an overall sense of the threat of exploitation in the wild. The percentile measures the EPSS probability relative to all known EPSS scores. Note: This data is updated daily, relying on the latest available EPSS model version. Check out the EPSS documentation for more details.
Do your applications use this vulnerable package?
In a few clicks we can analyze your entire application and see what components are vulnerable in your application, and suggest you quick fixes.
Test your applications- Snyk IDSNYK-PYTHON-CAIROSVG-20574178
- published8 Oct 2026
- disclosed8 Oct 2026
- creditmohammad adnan
Introduced: 8 Oct 2026
NewCVE-2026-107378 (opens in a new tab)How to fix?
Upgrade CairoSVG to version 2.9.1 or higher.
Overview
Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via the path tokenizer in cairosvg/path.py, where the path function uses repeated string splitting on SVG path data, resulting in quadratic time complexity. An attacker can supply an SVG file containing a large path string to cause excessive CPU consumption and crash the process.