{"api_version":"1","generated_at":"2026-10-21T23:06:39+00:00","cve":"CVE-2026-113811","urls":{"html":"https://cve.report/CVE-2026-113811","api":"https://cve.report/api/cve/CVE-2026-113811.json","docs":"https://cve.report/api","cve_org":"https://www.cve.org/CVERecord?id=CVE-2026-113811","nvd":"https://nvd.nist.gov/vuln/detail/CVE-2026-113811"},"summary":{"title":"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","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.\n\nThe 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.\n\nAn attacker who can submit text with many distinct characters to a long-lived matcher can grow its memory with each search.","state":"PUBLISHED","assigner":"CPANSec","published_at":"2026-10-21 21:17:55","updated_at":"2026-10-21 21:17:55"},"problem_types":["CWE-770","CWE-770 CWE-770 Allocation of Resources Without Limits or Throttling"],"metrics":[],"references":[{"url":"https://github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisories/GHSA-9vcx-647w-pr3h","name":"https://github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisories/GHSA-9vcx-647w-pr3h","refsource":"9b29abf9-4ab0-4765-b253-1875cd9b441e","tags":[],"title":"","mime":"","httpstatus":"","archivestatus":"0"},{"url":"https://github.com/robrwo/perl-Algorithm-UrataniTakeda/commit/79897ef86a5a9bb6bc381718fe977c8150bc3d5b.patch","name":"https://github.com/robrwo/perl-Algorithm-UrataniTakeda/commit/79897ef86a5a9bb6bc381718fe977c8150bc3d5b.patch","refsource":"9b29abf9-4ab0-4765-b253-1875cd9b441e","tags":[],"title":"","mime":"","httpstatus":"","archivestatus":"0"},{"url":"https://metacpan.org/release/RRWO/Algorithm-UrataniTakeda-v0.1.7/changes","name":"https://metacpan.org/release/RRWO/Algorithm-UrataniTakeda-v0.1.7/changes","refsource":"9b29abf9-4ab0-4765-b253-1875cd9b441e","tags":[],"title":"","mime":"","httpstatus":"","archivestatus":"0"},{"url":"https://www.cve.org/CVERecord?id=CVE-2026-113811","name":"CVE Program record","refsource":"CVE.ORG","tags":["canonical"]},{"url":"https://nvd.nist.gov/vuln/detail/CVE-2026-113811","name":"NVD vulnerability detail","refsource":"NVD","tags":["canonical","analysis"]}],"affected":[],"timeline":[],"solutions":[{"source":"CNA","title":"","value":"Upgrade to Algorithm-UrataniTakeda 0.1.7 or later.","time":"","lang":"en"}],"workarounds":[],"exploits":[],"credits":[],"nvd_cpes":[],"vendor_comments":[],"enrichments":{"kev":null,"epss":null,"legacy_qids":[]},"source_records":{"cve_program":{"containers":{"cna":{"affected":[{"collectionURL":"https://cpan.org/modules","defaultStatus":"unaffected","modules":["Algorithm::UrataniTakeda"],"packageName":"Algorithm-UrataniTakeda","packageURL":"pkg:cpan/Algorithm-UrataniTakeda","programFiles":["lib/Algorithm/UrataniTakeda.pm"],"programRoutines":[{"name":"Algorithm::UrataniTakeda::search"}],"repo":"https://github.com/robrwo/perl-Algorithm-UrataniTakeda","versions":[{"lessThan":"0.1.7","status":"affected","version":"0.1.5","versionType":"custom"}]}],"descriptions":[{"lang":"en","value":"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.\n\nThe 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.\n\nAn attacker who can submit text with many distinct characters to a long-lived matcher can grow its memory with each search."}],"problemTypes":[{"descriptions":[{"cweId":"CWE-770","description":"CWE-770 Allocation of Resources Without Limits or Throttling","lang":"en","type":"CWE"}]}],"providerMetadata":{"dateUpdated":"2026-10-21T20:58:36.873Z","orgId":"9b29abf9-4ab0-4765-b253-1875cd9b441e","shortName":"CPANSec"},"references":[{"tags":["vendor-advisory"],"url":"https://github.com/robrwo/perl-Algorithm-UrataniTakeda/security/advisories/GHSA-9vcx-647w-pr3h"},{"tags":["release-notes"],"url":"https://metacpan.org/release/RRWO/Algorithm-UrataniTakeda-v0.1.7/changes"},{"tags":["patch"],"url":"https://github.com/robrwo/perl-Algorithm-UrataniTakeda/commit/79897ef86a5a9bb6bc381718fe977c8150bc3d5b.patch"}],"solutions":[{"lang":"en","value":"Upgrade to Algorithm-UrataniTakeda 0.1.7 or later."}],"source":{"discovery":"UNKNOWN"},"title":"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","x_generator":{"engine":"cpansec-cna-tool 0.1"}}},"cveMetadata":{"assignerOrgId":"9b29abf9-4ab0-4765-b253-1875cd9b441e","assignerShortName":"CPANSec","cveId":"CVE-2026-113811","datePublished":"2026-10-21T20:58:36.873Z","dateReserved":"2026-10-20T18:30:13.185Z","dateUpdated":"2026-10-21T20:58:36.873Z","state":"PUBLISHED"},"dataType":"CVE_RECORD","dataVersion":"5.2"},"nvd":{"publishedDate":"2026-10-21 21:17:55","lastModifiedDate":"2026-10-21 21:17:55","problem_types":["CWE-770","CWE-770 CWE-770 Allocation of Resources Without Limits or Throttling"],"metrics":[],"configurations":[]},"legacy_mitre":{"record":{"CveYear":"2026","CveId":"113811","Ordinal":"1","Title":"Algorithm::UrataniTakeda versions from 0.1.5 before 0.1.7 for Pe","CVE":"CVE-2026-113811","Year":"2026"},"notes":[{"CveYear":"2026","CveId":"113811","Ordinal":"1","NoteData":"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.\n\nThe 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.\n\nAn attacker who can submit text with many distinct characters to a long-lived matcher can grow its memory with each search.","Type":"Description","Title":"Algorithm::UrataniTakeda versions from 0.1.5 before 0.1.7 for Pe"}]}}}