CVE Vulnerabilities

CVE-2023-22484

Inefficient Algorithmic Complexity

Published: Jan 23, 2023 | Modified: Feb 02, 2023
CVSS 3.x
7.5
HIGH
Source:
NVD
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H
CVSS 2.x
RedHat/V2
RedHat/V3
Ubuntu
MEDIUM

cmark-gfm is GitHubs fork of cmark, a CommonMark parsing and rendering library and program in C. Versions prior to 0.29.0.gfm.7 are subject to a polynomial time complexity issue in cmark-gfm that may lead to unbounded resource exhaustion and subsequent denial of service. This vulnerability has been patched in 0.29.0.gfm.7.

Weakness

An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.

Affected Software

Name Vendor Start Version End Version
Cmark-gfm Github * 0.29.0.gfm.7 (excluding)
Cmark-gfm Ubuntu kinetic *
Cmark-gfm Ubuntu lunar *
Cmark-gfm Ubuntu mantic *
Cmark-gfm Ubuntu trusty *
Cmark-gfm Ubuntu xenial *

References