CVE-2026-82729

Inefficient Algorithmic Complexity vulnerability in elixir-mint mint allows a remote HTTP server to exhaust CPU on the client host and cause a denial of service. parsehexprefix/2 in lib/mint/http1/parse.ex folds each hex digit of a chunked response's chunk-size field into an arbitrary-precision...

CVE-2026-82729

CVE-2026-82729 is an inefficient algorithmic complexity vulnerability in elixir-mint/mint , an Elixir HTTP client library. The root cause is in parse_hex_prefix/2 (in lib/mint/http1/parse.ex), which folds each hex digit of a chunked response's chunk-size field into an arbitrary-precision accumula...

EUVD-2026-71219

Inefficient Algorithmic Complexity vulnerability in elixir-mint mint allows a remote HTTP server to exhaust CPU on the client host and cause a denial of service. parsehexprefix/2 in lib/mint/http1/parse.ex folds each hex digit of a chunked response's chunk-size field into an arbitrary-precision...

CVE-2026-6042-PoC

CVE-2026-6042 : Déni de service par complexité algorithmique dans iconv de musl libc Les boucles de saut de plage dans le décodeur GB18030 4 octets de iconv de musl permettent à une petite charge utile conçue avec soin de consommer un temps CPU disproportionné. Une charge utile malveillante de 40...

EUVD-2026-67072

NLTK: Quadratic-time DoS in PorterStemmer via long runs of 'y'...

CVE-2026-81722

A flaw was found in the nltk PorterStemmer component. A remote attacker could exploit this vulnerability by providing a specially crafted, untrusted token. The inefficient algorithmic complexity in the stemming process, specifically within the isconsonant and measure helper functions, causes...

CVE-2026-77831

Inefficient Algorithmic Complexity vulnerability in ash-project ashpapertrail allows a user who can submit a large array attribute to a paper-trailed create or update action to cause a denial of service through excessive CPU and memory use. With full-diff change tracking,...

CVE-2026-77831 Algorithmic-complexity denial of service in AshPaperTrail full-diff list tracking

Inefficient Algorithmic Complexity vulnerability in ash-project ashpapertrail allows a user who can submit a large array attribute to a paper-trailed create or update action to cause a denial of service through excessive CPU and memory use. With full-diff change tracking,...

CVE-2026-77831

AshPaperTrail (an Elixir library from the ash-project ecosystem) contains an inefficient algorithmic complexity vulnerability in its full-diff list change tracking component (AshPaperTrail.ChangeBuilders.FullDiff.ListChange). The root cause is a cubic-time algorithm: when pairing prior array elem...

CVE-2026-77831 Algorithmic-complexity denial of service in AshPaperTrail full-diff list tracking

Inefficient Algorithmic Complexity vulnerability in ash-project ashpapertrail allows a user who can submit a large array attribute to a paper-trailed create or update action to cause a denial of service through excessive CPU and memory use. With full-diff change tracking,...

GHSA-8X48-8G7J-RQXP Duplicate Advisory: Quadratic-time DoS in PorterStemmer via long runs of 'y'

Duplicate Advisory This advisory has been withdrawn because it is a duplicate of GHSA-ww6m-cw3f-q94g. This link is maintained to preserve external references. Original Description nltk PorterStemmer in versions = 3.10.2 fixed in 3.10.3 contains an inefficient-algorithmic-complexity denial of...

Duplicate Advisory: Quadratic-time DoS in PorterStemmer via long runs of 'y'

Duplicate Advisory This advisory has been withdrawn because it is a duplicate of GHSA-ww6m-cw3f-q94g. This link is maintained to preserve external references. Original Description nltk PorterStemmer in versions = 3.10.2 fixed in 3.10.3 contains an inefficient-algorithmic-complexity denial of...

CVE-2026-81722

nltk PorterStemmer in versions = 3.10.2 fixed in 3.10.3 contains an inefficient-algorithmic-complexity denial of service in PorterStemmer.stem. The isconsonant helper walks backward over the entire run of trailing 'y' characters on every call, and measure invokes it for each stem position, causin...

UBUNTU-CVE-2026-81722

nltk PorterStemmer in versions = 3.10.2 fixed in 3.10.3 contains an inefficient-algorithmic-complexity denial of service in PorterStemmer.stem. The isconsonant helper walks backward over the entire run of trailing 'y' characters on every call, and measure invokes it for each stem position, causin...

CVE-2026-81722

nltk PorterStemmer in versions = 3.10.2 fixed in 3.10.3 contains an inefficient-algorithmic-complexity denial of service in PorterStemmer.stem. The isconsonant helper walks backward over the entire run of trailing 'y' characters on every call, and measure invokes it for each stem position, causin...

CVE-2026-81722

nltk PorterStemmer in versions ≤ 3.10.2 is vulnerable to an inefficient-algorithmic-complexity denial of service in PorterStemmer.stem(). The root cause is that the _is_consonant() helper walks backward over the entire run of trailing 'y' characters on every call, and _measure() invokes it for ea...

CVE-2026-81722 nltk PorterStemmer before 3.10.3 Quadratic-time DoS

nltk PorterStemmer in versions = 3.10.2 fixed in 3.10.3 contains an inefficient-algorithmic-complexity denial of service in PorterStemmer.stem. The isconsonant helper walks backward over the entire run of trailing 'y' characters on every call, and measure invokes it for each stem position, causin...

CVE-2026-81722 nltk PorterStemmer before 3.10.3 Quadratic-time DoS

nltk PorterStemmer in versions = 3.10.2 fixed in 3.10.3 contains an inefficient-algorithmic-complexity denial of service in PorterStemmer.stem. The isconsonant helper walks backward over the entire run of trailing 'y' characters on every call, and measure invokes it for each stem position, causin...

CVE-2026-75005

Inefficient Algorithmic Complexity vulnerability in Apache APISIX. A single small request can pin a gateway worker at 100% CPU for an extended period in graphql-limit-count routes. This issue affects Apache APISIX: 3.17.0. Users are recommended to upgrade to version 3.18.0, which fixes the issue...

EUVD-2026-66957

Inefficient Algorithmic Complexity vulnerability in Apache APISIX. A single small request can pin a gateway worker at 100% CPU for an extended period in graphql-limit-count routes. This issue affects Apache APISIX: 3.17.0. Users are recommended to upgrade to version 3.18.0, which fixes the issue...