Vulnerability · Published Oct 21, 2026 · Assigned by CPANSec
CVE-2026-113811Algorithm::UrataniTakeda versions from 0.1.5 before 0.1.7 for Perl allow memory exhaustion via a never-cleared failure shift cache in search
High 7.5
In plain English
A high-severity resource allocation without limits in Algorithm-UrataniTakeda. Proof-of-concept exploit code is public. The chance it is exploited in the next 30 days is estimated at 0.6% (higher than 49% of all known vulnerabilities).
Official 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.
Affected products (as reported)
| Vendor | Product | Versions |
|---|---|---|
| Algorithm-UrataniTakeda | 0.1.5 – before 0.1.7 |
Weakness: CWE-770 · Vector: CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H
References
- https://github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisories/GHSA-9vcx-647w-pr3h vendor-advisory
- https://metacpan.org/release/RRWO/Algorithm-UrataniTakeda-v0.1.7/changes release-notes
- https://github.com/robrwo/perl-Algorithm-UrataniTakeda/commit/79897ef86a5a9bb6bc381718fe977c8150bc3d5b.patch patch
- http://www.openwall.com/lists/oss-security/2026/10/21/27