Vulnerability Description
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.
CVSS Score
HIGH
Related Weaknesses (CWE)
References
- https://github.com/robrwo/perl-Algorithm-UrataniTakeda/commit/79897ef86a5a9bb6bc
- https://github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisories/GHSA-
- https://metacpan.org/release/RRWO/Algorithm-UrataniTakeda-v0.1.7/changes
- http://www.openwall.com/lists/oss-security/2026/10/21/27
- https://github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisories/GHSA-
FAQ
What is CVE-2026-113811?
CVE-2026-113811 is a vulnerability with a CVSS score of 7.5 (HIGH). 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 a...
How severe is CVE-2026-113811?
CVE-2026-113811 has been rated HIGH with a CVSS base score of 7.5/10. Review the CVSS metrics above for detailed severity breakdown.
Is there a patch for CVE-2026-113811?
Check the references section above for vendor advisories and patch information. Review vendor security bulletins for remediation guidance.