nth-check is vulnerable to Inefficient Regular Expression Complexity
The product uses a regular expression with an inefficient, possibly exponential worst-case computational complexity that consumes excessive CPU cycles.
| Name | Vendor | Start Version | End Version |
|---|---|---|---|
| Nth-check | Nth-check_project | * | 2.0.1 (excluding) |
| Node-nth-check | Ubuntu | bionic | * |
| Node-nth-check | Ubuntu | focal | * |
| Node-nth-check | Ubuntu | impish | * |
| Node-nth-check | Ubuntu | trusty | * |
| Node-nth-check | Ubuntu | upstream | * |
| Node-nth-check | Ubuntu | xenial | * |
Attackers can create crafted inputs that
intentionally cause the regular expression to use
excessive backtracking in a way that causes the CPU
consumption to spike.