A flaw was found in python. In algorithms with quadratic time complexity using non-binary bases, when using int("text"), a system could take 50ms to parse an int string with 100,000 digits and 5s for 1,000,000 digits (float, decimal, int.from_bytes(), and int() for binary bases 2, 4, 8, 16, and 32 are not affected). The highest threat from this vulnerability is to system availability.
https://github.com/python/cpython/issues/95778
https://docs.google.com/document/d/1KjuF_aXlzPUxTK4BMgezGJ2Pn7uevfX7g0_mvgHlL7Y
https://bugzilla.redhat.com/show_bug.cgi?id=1834423
https://access.redhat.com/security/cve/CVE-2020-10735
https://github.com/Vaidehit06/wazuh-siem-lab
https://lists.debian.org/debian-lts-announce/2024/12/msg00000.html
https://lists.debian.org/debian-lts-announce/2024/11/msg00024.html
https://lists.debian.org/debian-lts-announce/2023/06/msg00039.html
https://euvd.enisa.europa.eu/vulnerability/EUVD-2020-3159
https://cert-portal.siemens.com/productcert/html/ssa-806742.html
https://cert-portal.siemens.com/productcert/html/ssa-398330.html