Quadratic complexity may lead to a denial of service in cmark-gfm
Summary
Quadratic complexity may lead to a denial of service in cmark-gfm
Original description
The description as published by the source.
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.
Source: OSV.dev (Open Source Vulnerabilities) NVD GitHub Advisory OSV
Fix status by distribution
Fixed packages published by each distribution for this CVE
- Debian DEBIAN-CVE-2023-24824 cmark-gfm
- Ubuntu UBUNTU-CVE-2023-24824 cmark
References
- advisory github.com
- advisory github.com
- advisory nvd.nist.gov
- patch github.com