Multiple vulnerabilities in cmark-gfm

Published: 2023-04-03

Risk	Medium
Patch available	YES
Number of vulnerabilities	2
CVE-ID	CVE-2023-24824 CVE-2023-26485
CWE-ID	CWE-407
Exploitation vector	Network
Public exploit	N/A
Vulnerable software Subscribe	cmark-gfm Universal components / Libraries / Software for developers
Vendor	GitHub

Security Bulletin

This security bulletin contains information about 2 vulnerabilities.

1) Inefficient Algorithmic Complexity

EUVDB-ID: #VU74297

Risk: Medium

CVSSv3.1: 6.5 [CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H/E:U/RL:O/RC:C]

CVE-ID: CVE-2023-24824

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

Exploit availability: No

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.29.0.gfm.9

External links

http://github.com/github/cmark-gfm/security/advisories/GHSA-66g8-4hjf-77xh
http://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.

2) Inefficient Algorithmic Complexity

EUVDB-ID: #VU74298