SB2026041098 - Inefficient Algorithmic Complexity in PyPDF



SB2026041098 - Inefficient Algorithmic Complexity in PyPDF

Published: April 10, 2026

Security Bulletin ID SB2026041098
Severity
Low
Patch available
YES
Number of vulnerabilities 1
Exploitation vector Remote access
Highest impact Denial of service

Breakdown by Severity

Low 100%
  • Low
  • Medium
  • High
  • Critical

Description

This security bulletin contains information about 1 security vulnerability.


1) Inefficient Algorithmic Complexity (CVE-ID: CVE-2026-28804)

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

The vulnerability exists due to inefficient algorithmic complexity in the ASCIIHexDecode stream decoder when parsing a crafted PDF stream that uses the /ASCIIHexDecode filter. A remote attacker can supply a specially crafted PDF to cause a denial of service.

Exploitation requires the application to access a stream that uses the /ASCIIHexDecode filter.


Remediation

Install update from vendor's website.