Skip to main content

Inefficient Regular Expression Complexity

CVE-2025-25290

Medium
5.3/10

Summary

@octokit/request sends parameterized requests to GitHub's APIs with sensible defaults in browsers and Node. Starting in versions 1.0.0 through 8.4.0 and 9.0.0-beta.1 through 9.2.0, the regular expression '/<([^>]+)>; rel="deprecation"/' used to match the 'link' header in HTTP responses is vulnerable to a ReDoS (Regular Expression Denial of Service) attack. This vulnerability arises due to the unbounded nature of the regex's matching behavior, which can lead to catastrophic backtracking when processing specially crafted input. An attacker could exploit this flaw by sending a malicious 'link' header, resulting in excessive CPU usage and potentially causing the server to become unresponsive, impacting service availability.

  • LOW
  • NETWORK
  • NONE
  • UNCHANGED
  • NONE
  • NONE
  • NONE
  • LOW

CWE-1333 - Inefficient Regular Expression Complexity

The product uses a regular expression with an inefficient, possibly exponential worst-case computational complexity that consumes excessive CPU cycles.

References

Advisory Timeline

  • Published