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.
References5
- github.com/robrwo/perl-Algorithm-UrataniTakeda/commit/79897ef86…
- github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisor…
- metacpan.org/release/RRWO/Algorithm-UrataniTakeda-v0.1.7/changes
- www.openwall.com/lists/oss-security/2026/10/21/27
- github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisor…
Metrics
- CVSS 3.1
-
7.5
HIGH
Score source: CNA
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H - EPSS — exploit probability
- 1% percentile: 49 · as of 8 November 2026
- CWE
- CWE-770
Could this be exploited in your environment?
A patch closes the known hole. A penetration test shows what an attacker can still reach — with proof.