SB2025030401 - Ubuntu update for cmark-gfm

CSH
CYBERSECURITY HELP
Sign In REGISTER

Main Vulnerability Database SB2025030401

SB2025030401 - Ubuntu update for cmark-gfm

Published: March 4, 2025

Security Bulletin ID SB2025030401
CSH Severity
Medium
Patch available
YES
Number of vulnerabilities 5
Exploitation vector Remote access
Highest impact Denial of service

Breakdown by Severity

Medium 100%
  • Low
  • Medium
  • High
  • Critical

Description

This security bulletin contains information about 5 vulnerabilities.


1) Resource exhaustion (CVE-ID: CVE-2022-39209)

CWE-ID: CWE-400 - Resource exhaustion

CVSSv4: CVSS:4.0/AV:N/AC:L/AT:N/PR:L/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:U/U:Green


The vulnerability allows a remote attacker to perform a denial of service (DoS) attack.

The vulnerability exists due to a polynomial time complexity issue in the autolink extension. A remote user can trigger resource exhaustion and perform a denial of service (DoS) attack.


2) Inefficient Algorithmic Complexity (CVE-ID: CVE-2023-22483)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:U/U:Green


The vulnerability allows a remote attacker to perform a denial of service (DoS) attack.

The vulnerability exists due to several polynomial time complexity issues. A remote attacker can trigger resource exhaustion and perform a denial of service (DoS) attack.


3) Inefficient Algorithmic Complexity (CVE-ID: CVE-2023-22484)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:U/U:Green


The vulnerability allows a remote attacker to perform a denial of service (DoS) attack.

The vulnerability exists due to a polynomial time complexity issue in cmark-gfm may in handle_pointy_brace. A remote attacker can trigger resource exhaustion and perform a denial of service (DoS) attack.


4) Inefficient Algorithmic Complexity (CVE-ID: CVE-2023-22486)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:U/U:Green


The vulnerability allows a remote attacker to perform a denial of service (DoS) attack.

The vulnerability exists due to a polynomial time complexity issue in cmark-gfm in handle_close_bracket. A remote attacker can trigger resource exhaustion and perform a denial of service (DoS) attack.


5) Inefficient Algorithmic Complexity (CVE-ID: CVE-2023-26485)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:U/U:Green


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.


Remediation

Install update from vendor's website.

References