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.
An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.
| Name | Vendor | Start Version | End Version |
|---|---|---|---|
| Red Hat Hardened Images | RedHat | python3-14-main-3.14.6-2.2.hum1 | * |
| Red Hat Hardened Images | RedHat | python3-10-main-3.10.20-3.2.hum1 | * |
| Red Hat Hardened Images | RedHat | python3-11-main-3.11.15-5.5.hum1 | * |
| Red Hat Hardened Images | RedHat | python3-13-main-3.13.14-1.7.hum1 | * |
| Red Hat Hardened Images | RedHat | python3-12-main-3.12.13-3.8.hum1 | * |
| Red Hat Hardened Images | RedHat | python3-14-main-3.14.7-1.hum1 | * |
| Red Hat Hardened Images | RedHat | python3-13-main-3.13.15-1.hum1 | * |