Inefficient Regular Expression Complexity in GitHub repository node-fetch/node-fetch prior to 3.2.10.
Weakness
The product uses a regular expression with a worst-case computational complexity that is inefficient and possibly exponential.
Affected Software
| Name | Vendor | Start Version | End Version |
|---|---|---|---|
| Node-fetch | Node-fetch_project | 3.0.0 (including) | 3.2.10 (excluding) |
| Node-fetch | Ubuntu | bionic | * |
| Node-fetch | Ubuntu | focal | * |
| Node-fetch | Ubuntu | kinetic | * |
| Node-fetch | Ubuntu | lunar | * |
| Node-fetch | Ubuntu | mantic | * |
| Node-fetch | Ubuntu | oracular | * |
| Node-fetch | Ubuntu | plucky | * |
| Node-fetch | Ubuntu | questing | * |
Potential Mitigations
Related Attack Patterns
References
- https://github.com/node-fetch/node-fetch/commit/28802387292baee467e042e168d92597b5bbbe3d
- https://huntr.dev/bounties/a7e6a136-0a4b-46c4-ad20-802f1dd60bf7
- https://github.com/node-fetch/node-fetch/commit/28802387292baee467e042e168d92597b5bbbe3d
- https://huntr.dev/bounties/a7e6a136-0a4b-46c4-ad20-802f1dd60bf7