Skip to main content

Inefficient Algorithmic Complexity


Severity High
Score 7.5/10


The package 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 (DoS) . This CVE covers quadratic complexity issues when parsing text which leads to either large numbers of "_" characters. This issue affects cmark-gfm versions prior to 0.29.0.gfm.10 and cmark versions prior to 0.30.3. Users are advised to upgrade. Users unable to upgrade should validate that their input comes from trusted sources.

  • LOW
  • NONE
  • NONE
  • NONE
  • NONE
  • HIGH

CWE-407 - Inefficient Algorithmic Complexity

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.

Advisory Timeline

  • Published