CVE-2023-24824CWE-400CWE-407

Quadratic complexity may lead to a denial of service in cmark-gfm

Medium · published March 31, 2023

CVSS v3.1
5.3
EPSS
1%
Percentile
63.6
In the wild
Unconfirmed
What it is

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.

The record
Technical detail
CVSS v3.1
5.3 · MEDIUM
Vector
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:L
CVSS v4.0
Not supplied
EPSS
0.01036 · 63.6th percentile
Weaknesses
CWE-400 · Uncontrolled Resource Consumption; CWE-407 · Inefficient Algorithmic Complexity
Published
2023-03-31T22:01Z
EPSS history
Timeline
  • 31 MAR 22:01Z
    Quadratic complexity may lead to a denial of service in cmark-gfm
    cvelistv5