Net::IDN::Punycode versions before 2.590 for Perl allow CPU exhaustion via quadratic insertion cost when decoding a long label in decode_punycode.
The XS backend inserts each decoded code point into a UTF-8 buffer and finds the insertion point by scanning that buffer from the start, one character at a time. The scan runs once per code point over the output built so far, so the cost is quadratic in the label length. The pure-Perl backend downgrades its input to bytes so that substr can index it directly, but takes its working copy before the downgrade, so when the input carries the UTF-8 flag every substr on the copy scans from the start, with the same quadratic cost.
Nothing bounds the label length in the to-Unicode direction. The 63-byte DNS limit is checked only when converting to ASCII, so domain_to_unicode and uts46_to_unicode pass an attacker-supplied label of any length to the decoder.
References
Configurations
No configuration.
History
22 Sep 2026, 18:17
| Type | Values Removed | Values Added |
|---|---|---|
| References |
|
22 Sep 2026, 13:17
| Type | Values Removed | Values Added |
|---|---|---|
| CVSS |
v2 : v3 : |
v2 : unknown
v3 : 7.5 |
22 Sep 2026, 08:16
| Type | Values Removed | Values Added |
|---|---|---|
| New CVE |
Information
Published : 2026-09-22 08:16
Updated : 2026-09-22 19:07
NVD link : CVE-2026-87079
Mitre link : CVE-2026-87079
CVE.ORG link : CVE-2026-87079
JSON object : View
Products Affected
No product.
CWE
CWE-407
Inefficient Algorithmic Complexity
