SB2026041099 - Inefficient Algorithmic Complexity in PyPDF
Published: April 10, 2026
Security Bulletin ID
SB2026041099
Severity
Medium
Patch available
YES
Number of vulnerabilities
1
Exploitation vector
Remote access
Highest impact
Denial of service
Breakdown by Severity
- Low
- Medium
- High
- Critical
Description
This security bulletin contains information about 1 security vulnerability.
1) Inefficient Algorithmic Complexity (CVE-ID: CVE-2026-33123)
The vulnerability allows a remote attacker to cause a denial of service.
The vulnerability exists due to inefficient algorithmic complexity in array-based stream decoding when processing a crafted PDF containing an array-based stream with many entries. A remote attacker can supply a specially crafted PDF to cause a denial of service.
Exploitation requires the application to access an array-based stream with many entries in the PDF.
Remediation
Install update from vendor's website.