Algorithm::UrataniTakeda versions from 0.1.5 before 0.1.7 for Perl allow memory exhaustion via a never-cleared failure shift cache in search.
The failure shift is cached for each pair of trie state and text character in a field of the matcher object, and nothing clears it. A character not seen before at a given state adds an entry that lasts for the life of the matcher.
An attacker who can submit text with many distinct characters to a long-lived matcher can grow its memory with each search.
References
Configurations
No configuration.
History
30 Oct 2026, 16:17
| Type | Values Removed | Values Added |
|---|---|---|
| References | () https://github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisories/GHSA-9vcx-647w-pr3h - | |
| CVSS |
v2 : v3 : |
v2 : unknown
v3 : 7.5 |
22 Oct 2026, 01:16
| Type | Values Removed | Values Added |
|---|---|---|
| References |
|
21 Oct 2026, 21:17
| Type | Values Removed | Values Added |
|---|---|---|
| New CVE |
Information
Published : 2026-10-21 21:17
Updated : 2026-10-30 16:17
NVD link : CVE-2026-113811
Mitre link : CVE-2026-113811
CVE.ORG link : CVE-2026-113811
JSON object : View
Products Affected
No product.
CWE
CWE-770
Allocation of Resources Without Limits or Throttling
