cmark-gfm Time Complexity DoS before 0.29.0
CVE-2023-22483 Published on January 23, 2023

cmark-gfm Quadratic complexity bugs may lead to a denial of service
cmark-gfm is GitHub's fork of cmark, a CommonMark parsing and rendering library and program in C. Versions prior to 0.29.0.gfm.7 are subject to several polynomial time complexity issues in cmark-gfm that may lead to unbounded resource exhaustion and subsequent denial of service. Various commands, when piped to cmark-gfm with large values, cause the running time to increase quadratically. These vulnerabilities have been patched in version 0.29.0.gfm.7.

NVD

Vulnerability Analysis

Attack Vector:
ADJACENT_NETWORK
Attack Complexity:
LOW
Privileges Required:
LOW
User Interaction:
NONE
Scope:
UNCHANGED
Confidentiality Impact:
NONE
Integrity Impact:
NONE
Availability Impact:
LOW

Weakness Type

What is a Resource Exhaustion Vulnerability?

The software does not properly control the allocation and maintenance of a limited resource, thereby enabling an actor to influence the amount of resources consumed, eventually leading to the exhaustion of available resources.

CVE-2023-22483 has been classified to as a Resource Exhaustion vulnerability or weakness.


Products Associated with CVE-2023-22483

stack.watch emails you whenever new vulnerabilities are published in github Cmark Gfm or Canonical Ubuntu Linux. Just hit a watch button to start following.

 
 

Affected Versions

github cmark-gfm Version < 0.29.0.gfm.7 is affected by CVE-2023-22483

Exploit Probability

EPSS
0.12%
Percentile
30.46%

EPSS (Exploit Prediction Scoring System) scores estimate the probability that a vulnerability will be exploited in the wild within the next 30 days. The percentile shows you how this score compares to all other vulnerabilities.