Description
NanoMQ is an MQTT broker. Prior to 0.24.14, NanoMQ's MQTT v5 property decoder in nng/src/supplemental/mqtt/mqtt_codec.c uses property_append() to walk the entire linked list for each property added by decode_buf_properties(). A remote unauthenticated client can supply a PUBLISH or SUBSCRIBE packet containing many User Properties, causing O(N²) linked-list insertion and CPU work that makes the broker unresponsive; repeated packets can sustain the denial of service. This issue is fixed in version 0.24.14.
Published: 2026-09-18
Score: 3.7 Low
EPSS: < 1% Very Low
KEV: No
Impact: Denial of Service
Action: Apply Patch
AI Analysis

Impact

NanoMQ’s MQTT v5 property decoder performs O(N²) linked‑list insertions for each User Property in a packet. A remote, unauthenticated client can send a PUBLISH or SUBSCRIBE message containing many User Properties, exhausting CPU resources and rendering the broker unresponsive. Persistently sending such packets can maintain the DoS condition. The weakness is identified as CWE‑407, reflecting inefficient algorithmic complexity.

Affected Systems

This flaw affects the NanoMQ MQTT broker (nanomq:nanomq) versions prior to 0.24.14. The advisory recommends upgrading to version 0.24.14 or later to apply the fix that corrects the property parsing logic.

Risk and Exploitability

The CVSS score is 3.7, indicating a moderate risk. EPSS score is < 1% and the vulnerability is not listed in CISA’s KEV catalog. An attacker can exploit the flaw from anywhere on the network with an unauthenticated MQTT client, triggering a denial of service by sending packets that contain a large number of User Properties. Successful exploitation requires only network access to the broker; no local privileges or additional credentials are needed.

Generated by OpenCVE AI on September 19, 2026 at 17:28 UTC.

Remediation

No solution or workaround provided in the CVE record.

OpenCVE Recommended Actions

  • Upgrade NanoMQ to version 0.24.14 or newer, where the O(N²) property parsing has been fixed.
  • If possible, configure the broker to limit the maximum number of User Properties per MQTT packet or enable size checks for incoming properties.
  • Monitor broker CPU usage and client activity; identify and throttle or block clients that repeatedly send packets with an unusually high number of User Properties.

Generated by OpenCVE AI on September 19, 2026 at 17:28 UTC.

Tracking

Sign in to view the affected projects.

Advisories

No advisories yet.

History

Fri, 18 Sep 2026 23:45:00 +0000

Type Values Removed Values Added
First Time appeared Nanomq
Nanomq nanomq
Vendors & Products Nanomq
Nanomq nanomq

Fri, 18 Sep 2026 21:30:00 +0000

Type Values Removed Values Added
Metrics ssvc

{'options': {'Automatable': 'no', 'Exploitation': 'poc', 'Technical Impact': 'partial'}, 'version': '2.0.3'}


Fri, 18 Sep 2026 16:30:00 +0000

Type Values Removed Values Added
Description NanoMQ is an MQTT broker. Prior to 0.24.14, NanoMQ's MQTT v5 property decoder in nng/src/supplemental/mqtt/mqtt_codec.c uses property_append() to walk the entire linked list for each property added by decode_buf_properties(). A remote unauthenticated client can supply a PUBLISH or SUBSCRIBE packet containing many User Properties, causing O(N²) linked-list insertion and CPU work that makes the broker unresponsive; repeated packets can sustain the denial of service. This issue is fixed in version 0.24.14.
Title NanoMQ: O(N²) Denial of Service in MQTT v5 Property Parsing
Weaknesses CWE-407
References
Metrics cvssV3_1

{'score': 3.7, 'vector': 'CVSS:3.1/AV:N/AC:H/PR:N/UI:N/S:U/C:N/I:N/A:L'}


cve-icon MITRE

Status: PUBLISHED

Assigner: GitHub_M

Published:

Updated: 2026-09-18T17:21:50.284Z

Reserved: 2026-05-07T15:30:10.875Z

Link: CVE-2026-44639

cve-icon Vulnrichment

Updated: 2026-09-18T17:19:25.454Z

cve-icon NVD

Status : Deferred

Published: 2026-09-18T17:16:57.127

Modified: 2026-09-18T18:17:06.990

Link: CVE-2026-44639

cve-icon Redhat

No data.

cve-icon OpenCVE Enrichment

Updated: 2026-09-19T17:30:07Z

Weaknesses
  • CWE-407

    Inefficient Algorithmic Complexity