Inefficient Algorithmic Complexity in Botan - CVE-2026-44378
Published: May 7, 2026
Vulnerability details
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.
Affected software
Debian Linux
openEuler
Fedora
botan2-doc
python3-botan2
botan2-devel
botan2-debugsource
botan2-debuginfo
botan2
botan3 (Debian package)
botan3
How to mitigate CVE-2026-44378
botan2-doc - addressed in versions 2.19.3-6, 2.19.3-7
python3-botan2 - addressed in versions 2.19.3-6, 2.19.3-7
botan2-devel - addressed in versions 2.19.3-6, 2.19.3-7
botan2-debugsource - addressed in versions 2.19.3-6, 2.19.3-7
botan2-debuginfo - addressed in versions 2.19.3-6, 2.19.3-7
botan2 - addressed in versions 2.19.3-6, 2.19.3-7
botan3 (Debian package) - update to 3.12.0+dfsg-2~deb13u1
botan3 - update to 3.12.0-1.fc46