Quadratic complexity may lead to a denial of service in cmark-gfm
概要
Quadratic complexity may lead to a denial of service in cmark-gfm
原文の説明
取得元が公開している説明をそのまま載せています (多くは英語)。
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.
出典: OSV.dev (Open Source Vulnerabilities) NVD GitHub Advisory OSV
ディストリビューション別の修正状況
各ディストリビューションが公開している、この CVE の修正パッケージ
- Debian DEBIAN-CVE-2023-24824 cmark-gfm
- Ubuntu UBUNTU-CVE-2023-24824 cmark
参照URL
- advisory github.com
- advisory github.com
- advisory nvd.nist.gov
- patch github.com