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.
{
"cna_assigner": "CPANSec",
"cwe_ids": [
"CWE-770"
],
"osv_generated_from": "https://github.com/CVEProject/cvelistV5/tree/main/cves/2026/113xxx/CVE-2026-113811.json"
}{
"extracted_events": [
{
"range": [
{
"introduced": "0.1.5"
},
{
"fixed": "0.1.7"
}
],
"source": "AFFECTED_FIELD",
"strategy": "StandardRange"
},
{
"range": [
{
"fixed": "79897ef86a5a9bb6bc381718fe977c8150bc3d5b"
}
],
"source": "REFERENCES_COMMIT"
}
]
}