SB2026050781 - Inefficient Algorithmic Complexity in Botan
Published: May 7, 2026
Security Bulletin ID
SB2026050781
CSH 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 vulnerability.
1) Inefficient Algorithmic Complexity (CVE-ID: CVE-2026-44378)
CWE-ID: CWE-407 - Inefficient Algorithmic Complexity
CVSSv4: CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:U/U:Green
The vulnerability allows a remote attacker to cause a denial of service.
The vulnerability exists due to inefficient algorithmic complexity in the BER parser when parsing indefinite length encodings in ASN.1 encoded data. A remote attacker can send specially crafted ASN.1 data to cause a denial of service.
This can be triggered with ASN.1 encoded inputs such as an X.509 certificate or OCSP response.
Remediation
Install update from vendor's website.