#VU74297 Inefficient Algorithmic Complexity in cmark-gfm - CVE-2023-24824

Vulnerability identifier: #VU74297

Vulnerability risk: Medium

CVSSv4.0: 6.6 [CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:U/U:Green]

CVE-ID: CVE-2023-24824

CWE-ID: CWE-407

Exploitation vector: Network

Exploit availability: No

Vulnerable software:
cmark-gfm
Universal components / Libraries / Software for developers

Vendor: GitHub

Description

The vulnerability allows a remote attacker to perform a denial of service (DoS) attack.

The vulnerability exists due to the polynomial time complexity issue. A remote attacker can pass specially crafted input to the application and perform a denial of service (DoS) attack.

Mitigation
Install updates from vendor's website.

Vulnerable software versions

cmark-gfm: 0.27.1.gfm.0 - 0.27.1.gfm.4, 0.28.0.gfm.5 - 0.28.3.gfm.21, 0.29.0.gfm.0 - 0.29.0.gfm.9

---

External links
https://github.com/github/cmark-gfm/security/advisories/GHSA-66g8-4hjf-77xh
https://github.com/github/cmark-gfm/commit/2300c1bd2c8226108885bf019655c4159cf26b59

---

Q & A

Can this vulnerability be exploited remotely?

Yes. This vulnerability can be exploited by a remote non-authenticated attacker via the Internet.

Is there known malware, which exploits this vulnerability?

No. We are not aware of malware exploiting this vulnerability.