Inefficient Regular Expression Complexity in Chinese-Poetry by Chinese-Poetry
CVE-2025-7579

5.3MEDIUM

Key Information:

Vendor
CVE Published:
14 July 2025

Badges

👾 Exploit Exists🟡 Public PoC

What is CVE-2025-7579?

A vulnerability has been identified in the Chinese-Poetry package version 0.1, specifically in the file rank/server.js. This issue involves an inefficient regular expression complexity, which can potentially lead to significant performance degradation. Attackers may exploit this vulnerability remotely, causing detrimental effects on server operations. The flaw has been publicly disclosed, raising concerns about its misuse in various security environments.

Affected Version(s)

chinese-poetry 0.1

Exploit Proof of Concept (PoC)

PoC code is written by security researchers to demonstrate the vulnerability can be exploited. PoC code is also a key component for weaponization which could lead to ransomware.

References

CVSS V4

Score:
5.3
Severity:
MEDIUM
Confidentiality:
None
Integrity:
None
Availability:
Low
Attack Vector:
Network
Attack Complexity:
Low
Attack Required:
None
Privileges Required:
Undefined
User Interaction:
None

Timeline

  • 🟡

    Public PoC available

  • 👾

    Exploit known to exist

  • Vulnerability published

  • Vulnerability Reserved

Credit

DayShift (VulDB User)
.
CVE-2025-7579 : Inefficient Regular Expression Complexity in Chinese-Poetry by Chinese-Poetry