NETAPP StorageGRID versions 12.1.0 up to but not including 12.1.0.2 have an information exposure vulnerability. This flaw allows a remote unauthenticated attacker to obtain low-sensitivity credentials via a man-in-the-middle attack when certain non-default features are enabled. The vulnerability has a low severity score and does not involve high-impact conditions such as privilege escalation or data integrity compromise. A fix is available in version 12.1.0.2.
NLTK version 3.10.3 contains an incomplete fix for JVM argument injection and untrusted JAR execution vulnerabilities in the nltk.internals.java() function. While the patch blocks unsafe launcher tokens in the 'options' argument, it fails to validate the first item of the 'cmd' argument sequence, allowing an attacker to supply launcher tokens such as '-jar' or '@argfile' to execute arbitrary external JAR files. This bypass affects both direct calls to nltk.internals.java() and the higher-level StanfordSegmenter interface. The issue is fixed in version 3.10.4.
NLTK versions 3.6 through 3.10.3 contain a vulnerability in the XMLCorpusView streaming XML reader where processing XML files with large comment or CDATA sections can cause a quadratic CPU denial of service. This occurs because the XML parsing function repeatedly performs expensive regex validations on growing buffers while reading the XML in 1 KiB blocks. The issue is fixed in version 3.10.4.
A vulnerability in the NLTK Python package downloader affects versions 3.6.7 through 3.10.3. The downloader's index update function performs a breadth-first search to compute package closures without cycle detection or depth limits. Malicious or compromised index data containing self-referencing or mutually referencing collections causes an infinite loop, leading to 100% CPU usage and unbounded memory growth until process termination. This flaw can cause denial of service during downloader operations that rely on index parsing.
NLTK's ARFF_Formatter component improperly handles class labels when generating Weka ARFF files, allowing attacker-controlled labels to inject arbitrary ARFF schema directives. This occurs because class labels are embedded without escaping, enabling injection of ARFF metacharacters that can alter the ARFF file structure. The vulnerability affects any application using WekaClassifier.train() or ARFF_Formatter.from_train() with untrusted training data. A fix has been merged but not yet released as of the latest information.
The Natural Language Toolkit (NLTK) DependencyGraph component uses unbounded recursion in its tree() and triples() methods to walk parsed dependency structures, which can lead to a crash via RecursionError when processing crafted long dependency chains. This occurs because these methods do not use the class's cycle detection and lack recursion depth limits, unlike other parts of NLTK. An attacker supplying a maliciously long dependency-parse file can cause denial of service by crashing the process. This issue affects versions prior to 3.10.4 and has been fixed in 3.10.4.
NLTK versions prior to 3.10.4 contain a vulnerability in the Synset.tree() and Synset.acyclic_tree() methods where recursive traversal lacks a maximum call-depth safeguard. This can lead to a crash via unhandled RecursionError when processing a long, genuinely acyclic relation chain in a custom WordNet-format lexical resource. The default bundled WordNet corpus is not affected due to its shallow relation depths. The vulnerability does not affect Synset.closure(), which uses an iterative traversal method. A fix is available in version 3.10.4.
A malicious file identified by the SHA-256 hash a74f60e5deac9ecf7953ee0f855a5a493832b6b143141e75526bf954720f303f was observed twice on November 19, 2026, by OffSeq Mirage honeypot sensors. The file is associated with attacker activity involving the MITRE ATT&CK technique T1105 (Ingress Tool Transfer). The malicious payload could be a dropper, web shell, miner, or post-exploitation tool delivered or staged during the attack. The attacker infrastructure was located in Vietnam. This indicator can be used to detect the presence of this malicious file in environments by matching the hash against endpoint detection and response (EDR), antivirus (AV), and threat intelligence feeds.
NLTK's CCG lexicon parser suffers from uncontrolled recursion when parsing deeply nested parenthesized categories, leading to a denial of service via an unhandled RecursionError. This occurs because the parser functions do not limit recursion depth or input length, allowing crafted inputs to exceed Python's recursion limit and abort parsing. The issue affects versions prior to 3.10.4 and has been fixed in version 3.10.4.
NLTK's DependencyGraph traversal methods (_tree, triples, get_cycle_path) use uncontrolled recursion without depth limits or visited sets, causing a RecursionError and denial of service when processing deep or cyclic dependency chains. This affects applications parsing untrusted CoNLL/Malt-TAB dependency structures. The flaw does not impact confidentiality or integrity but causes application termination due to unhandled recursion errors. A fix bounding recursion depth and adding cycle detection has been merged but is not yet released as of version 3.10.3.
The NLTK library's semantic-logic type parser has an uncontrolled recursion vulnerability in the read_type function, which processes nested type strings without a recursion depth limit. This can cause a RecursionError and denial of service when parsing deeply nested type strings. The issue affects versions prior to 3.10.4 and is fixed in version 3.10.4.
NLTK's Tree.fromlist method recursively converts nested lists into Tree objects without limiting recursion depth, unlike Tree.fromstring which enforces a MAX_TREE_DEPTH limit. This lack of depth checking allows an attacker to cause a denial of service by providing deeply nested list input, triggering an unhandled RecursionError. The issue affects versions prior to 3.10.4 and is fixed in 3.10.4.
NLTK's Toolbox settings helpers contain uncontrolled recursion when processing deeply nested input, leading to a denial of service via unhandled RecursionError. The recursion depth is unbounded in several helper functions that traverse the parsed element tree, allowing an attacker to cause application termination by supplying deeply nested settings files. The flaw does not affect confidentiality or integrity. A fix bounding recursion depth was merged but not yet released as of the latest data.
NLTK versions 3.10.0 through 3.10.3 contain a compile-time regular-expression denial of service (ReDoS) vulnerability in their regex search and tokenizer functions. This vulnerability arises because the third-party regex engine used by NLTK compiles patterns with many capturing groups in roughly quadratic time, allowing an attacker to supply a crafted regex pattern that causes excessive CPU consumption during compilation. This leads to denial of service by exhausting CPU resources. The vulnerability does not affect confidentiality or integrity and is remediated in NLTK version 3.10.4.
NLTK versions prior to 3.10.4 contain a vulnerability in four hypernym-walking methods of the WordNet Synset class that perform recursive graph traversal without cycle detection or depth limits. An attacker who can supply a malicious WordNet corpus file with cyclic or excessively deep hypernym pointer graphs can cause these methods to recurse indefinitely, resulting in a RecursionError that aborts the traversal and potentially crashes the application process. This vulnerability impacts availability only and requires no special privileges beyond loading attacker-controlled corpus data. The issue is fixed in NLTK version 3.10.4.
NLTK's SeekableUnicodeStreamReader.readline function has a performance issue where reading a single very long line without a newline character causes quadratic CPU usage due to repeated rescanning of an accumulating buffer. An attacker controlling the corpus file content can exploit this by providing a large unterminated line, causing significant CPU consumption and denial of service. The issue affects NLTK versions prior to 3.10.4 and has been fixed in version 3.10.4.
NLTK's XMLCorpusView.read_block method suffers from a quadratic CPU exhaustion vulnerability when processing deeply nested XML corpus tags. This occurs because the method rebuilds the full root-to-node context path on every start tag while searching for a matching element, causing O(n^2) computational complexity relative to the nesting depth. An attacker who can supply or influence the XML corpus file can cause high CPU usage, leading to denial of service. The vulnerability affects versions prior to 3.10.4 and has no impact on confidentiality or integrity, only availability.
NLTK versions 3.10.0 through 3.10.3 contain a vulnerability in the StreamBackedCorpusView constructor where the os.stat call on a file path string leaks metadata about files outside the allowed sandbox roots. This bypasses the pathsec enforcement intended to restrict filesystem access, exposing file existence, exact size, and modification time without disclosing file content. The vulnerability requires an attacker to influence the file path string passed to the constructor. The issue is fixed in version 3.10.4.
NLTK versions up to 3.10.3 have a vulnerability in the prover9 and mace4 configuration that allows local code execution when a relative binary_location is used. The issue arises because the code accepts relative paths for the prover9/mace4 binaries without validating that they are absolute paths, leading to execution of attacker-planted binaries in the current working directory. This flaw is due to missing path validation that other similar components in NLTK enforce. A fix is available in version 3.10.4, which rejects relative binary locations and enforces absolute-only paths.
The ct-fivem npm package contains malicious code that fully compromises any computer on which it is installed or running. This compromise includes potential unauthorized access and control, necessitating immediate rotation of all secrets and keys from a separate, secure machine. Removal of the package alone does not guarantee elimination of all malicious software introduced by its installation.