SB2026091224 - Inefficient Algorithmic Complexity in PyPDF
Published: September 12, 2026
Security Bulletin ID
SB2026091224
CSH Severity
Low
Patch available
YES
Number of vulnerabilities
1
Exploitation vector
Remote access
Highest impact
Partial DoS
Breakdown by Severity
- 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: 4.6 [CVSS:4.0/AV:L/AC:L/AT:N/PR:N/UI:A/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N]
The vulnerability allows a remote attacker to cause a denial of service.
The vulnerability exists due to inefficient algorithmic complexity in the indirect object parser when parsing a crafted PDF document. A remote attacker can craft a PDF with long indirect object headers to cause a denial of service.
The indirect object headers must not be terminated by whitespace.
Remediation
Install update from vendor's website.