CVE-2023-24824
A polynomial time complexity issue in cmark-gfm may lead to unbounded resource exhaustion and subsequent denial of service.
Does this matter?
High impact if exploited, but EPSS currently rates exploitation as unlikely (1.04%). Schedule it in the normal patch cycle and watch for a rise in EPSS or a public exploit.
Description
cmark-gfm is GitHub's fork of cmark, a CommonMark parsing and rendering library and program in C. A polynomial time complexity issue in cmark-gfm may lead to unbounded resource exhaustion and subsequent denial of service. This CVE covers quadratic complexity issues when parsing text which leads with either large numbers of `>` or `-` characters. This issue has been addressed in version 0.29.0.gfm.10. Users are advised to upgrade. Users unable to upgrade should validate that their input comes from trusted sources.
- CVSS 3.1
- 7.5 HIGHCVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H
- EPSS
- 1.04% probability · 62th percentile
- CISA KEV
- Not listed
- Weakness
- CWE-400, CWE-407
- Affected
- github/cmark-gfm
- Source
- security-advisories@github.com
References
- https://github.com/github/cmark-gfm/commit/2300c1bd2c8226108885bf019655c4159cf26b59Patch
- https://github.com/github/cmark-gfm/security/advisories/GHSA-66g8-4hjf-77xhExploit, Vendor Advisory
- https://github.com/github/cmark-gfm/commit/2300c1bd2c8226108885bf019655c4159cf26b59Patch
- https://github.com/github/cmark-gfm/security/advisories/GHSA-66g8-4hjf-77xhExploit, Vendor Advisory
Source: NVD record, EPSS from FIRST.org, KEV from CISA. Refreshed daily.