Analysis and contextual insights are available on OpenCVE Cloud.
No vendor fix or workaround currently provided.
Additional remediation guidance may be available on OpenCVE Cloud.
Tracking
Sign in to view the affected projects.
No advisories yet.
Tue, 28 Jul 2026 16:15:00 +0000
| Type | Values Removed | Values Added |
|---|---|---|
| Description | `Element.findall()` and fully-consumed `Element.iterfind()` exhibit `O(n^2)` time complexity when using XPath index predicates (e.g. `[1]`, `[last()]`, `[last()-N]`) on XML documents with many same-tag siblings. `Element.find()` is only affected when the first match is near the end of the sibling list, such as with `[last()]` or `[last()-N]`; `.//item[1]` short-circuits after the first match. | |
| Title | Quadratic Behavior in xml.etree.ElementPath Index Predicates | |
| Weaknesses | CWE-407 | |
| References |
| |
| Metrics |
cvssV4_0
|
Subscriptions
No data.
Status: PUBLISHED
Assigner: PSF
Published:
Updated: 2026-07-28T14:54:07.235Z
Reserved: 2026-04-22T18:26:56.743Z
Link: CVE-2026-6879
Updated: 2026-07-28T14:50:05.923Z
No data.
No data.
OpenCVE Enrichment
No data.
-
CWE-407
Inefficient Algorithmic Complexity