10

CVE-2026-82617: Apache OpenNLP, Apache OpenNLP: ReDoS / stack exhaustion in RegexNameFinderFactory built-in EMAIL and URL patterns

Analyzed
AliasesUBUNTU-CVE-2026-82617DEBIAN-CVE-2026-82617
Published 11-09-2026Last modified 11-09-2026

Vulnerability summary

CVE-2026-82617 is a critical (CVSS 10.0) vulnerability in apache software foundation apache opennlp. EPSS estimates a 0.77% chance of exploitation in the next 30 days, higher than 56.4% of scored vulnerabilities.

Priority
Prioritisesevere

Severe, CVSS 10 (CVE.org); no exploitation reported by the 5 checked sources; EPSS 1% (FIRST, 20-11-2026)

Source freshness unavailable

How is this decided?
CVSS score
10.0/10
010
Critical · v4.0 (CVE.org)
EPSS score
0.77%
0%100%
Low · 0.00 pp in 30 days
KEVNot listedNot listed by any tracked catalog.
RansomwareNot flaggedNo ransomware use recorded.
Public exploits0No public exploits recorded

Advisory lineage

Upstream 0 · Downstream 1 · Related 1

Timeline

  1. 11-09-2026
    PublishedVulnerability first disclosed.
  2. 11-09-2026
    Last modifiedVulnerability information updated.

Description

The two built-in name-finder patterns exposed by opennlp.tools.namefind.RegexNameFinderFactory - DEFAULT_REGEX_NAME_FINDER.EMAIL and DEFAULT_REGEX_NAME_FINDER.URL - contain ambiguous nested quantifiers. An application that obtains these finders through RegexNameFinderFactory.getDefaultRegexNameFinders(...) and then applies them to untrusted text through RegexNameFinder.find(String[]) or RegexNameFinder.find(String) can be driven into super-linear backtracking or into unbounded matcher recursion by a small crafted input. For the EMAIL pattern, a long run of local-part characters that is never followed by an @ forces the matcher to re-scan to end-of-input from every starting offset. Cost grows quadratically with input length: an input of approximately 32 KB consumes several seconds of CPU in a single find() call and returns no match, and each doubling of the input multiplies the cost roughly four-fold. For the URL pattern, the query-string sub-expression nests a capturing repetition inside an outer repetition. The JDK matcher recurses once per query token, so an input of approximately 4 KB containing many &-separated tokens exhausts the thread stack and causes java.lang.StackOverflowError to propagate out of find(), terminating the calling thread. On a thread created with a smaller stack (for example -Xss512k, typical of server worker pools) approximately 1 KB is sufficient. In both cases an attacker who can supply text for analysis can convert a single request into seconds to minutes of pinned CPU, or into an abrupt thread death, denying service to the embedding application. No authentication, special configuration, or model file is required beyond the application having selected one of the two built-in finders. This issue affects Apache OpenNLP: from 2.0.0 through 2.5.11; from 3.0.0-M1 through 3.0.0-M5. Users are recommended to upgrade to version 2.5.12, or to 3.0.0-M6 for users tracking the 3.0.0 milestone line, which fix the issue.

CVSS metrics

6 scores · 4 sources · 2 versions

EPSS trend

Probability

0.77%

Chance of exploitation in the next 30 days

Percentile

56%

Versus all other CVEs

30-day change

No change 0.00 pp

From 0.77% on 21-10-2026

21-10-202620-11-2026

Known exploited

Compare KEV catalogs
CISA KEV

Not in the CISA KEV catalog.

ENISA CNW

Not in the ENISA CNW catalog.

CIRCL

Not in the CIRCL catalog.

Public exploits

0 found

No public exploits indexed.

Weaknesses

CWE · root cause

Affected systems

Version check

Known conditions: network-reachable, no authentication, no user interaction (CVSS vector). Other conditions: not stated in public data.

Apache1 product
  • opennlp≥ 2.0.0, < 2.5.12 | 3.0.0:m1 | 3.0.0:m2 | 3.0.0:m3 | 3.0.0:m4 | 3.0.0:m5
Apache software foundation1 product
Debian1 product
  • apache-opennlpAll versions (No fix recorded) | < 2.5.12-1
Ubuntu1 product
  • apache-opennlpAll versions (No fix recorded)

4 vendors · 4 products

References

5 links