Quadratic complexity may lead to a denial of service in cmark-gfm
CVE-2023-26485
7.5HIGH
Summary
A polynomial time complexity vulnerability in cmark-gfm, GitHub's fork of the cmark library, can result in unbounded resource exhaustion and denial of service. The issue arises during the parsing of text that contains a large number of underscore characters, leading to quadratic increases in processing time. Affected users are urged to upgrade to version 0.29.0.gfm.10 to mitigate this risk, and those who cannot upgrade should ensure their input sources are trusted.
Affected Version(s)
cmark-gfm < 0.29.0.gfm.10
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