| Bug ID | 1210042 |
|---|---|
| Summary | VUL-0: CVE-2023-24824: polynomial time complexity during rendering leads to DoS |
| Classification | openSUSE |
| Product | openSUSE Distribution |
| Version | Leap 15.4 |
| Hardware | Other |
| OS | Other |
| Status | NEW |
| Severity | Normal |
| Priority | P5 - None |
| Component | Security |
| Assignee | dmueller@suse.com |
| Reporter | carlos.lopez@suse.com |
| QA Contact | security-team@suse.de |
| CC | peter.simons@suse.com |
| Found By | --- |
| Blocker | --- |
CVE-2023-24824 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. References: http://web.nvd.nist.gov/view/vuln/detail?vulnId=CVE-2023-24824 https://www.cve.org/CVERecord?id=CVE-2023-24824 http://www.cvedetails.com/cve/CVE-2023-24824/ https://github.com/github/cmark-gfm/commit/2300c1bd2c8226108885bf019655c4159cf26b59 https://github.com/github/cmark-gfm/security/advisories/GHSA-66g8-4hjf-77xh