cmark-gfm Quadratic complexity bugs may lead to a denial of service
CVE-2023-22483
7.5HIGH
Summary
The cmark-gfm library, GitHub's fork of the CommonMark parsing and rendering library, is vulnerable to polynomial time complexity issues that can lead to unbounded resource exhaustion. Certain commands processed with large values can cause the execution time to grow quadratically, potentially resulting in denial of service scenarios. Versions prior to 0.29.0.gfm.7 are affected by this vulnerability, with a patch available in the latest release.
Affected Version(s)
cmark-gfm < 0.29.0.gfm.7
References
CVSS V3.1
Score:
7.5
Severity:
HIGH
Confidentiality:
None
Integrity:
None
Availability:
None
Attack Vector:
Network
Attack Complexity:
Low
Privileges Required:
None
User Interaction:
None
Scope:
Unchanged
Timeline
Vulnerability published
Vulnerability Reserved