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.
Metrics
Affected Vendors & Products
Advisories
| Source | ID | Title |
|---|---|---|
Debian DLA |
DLA-3477-1 | python3.7 security update |
Debian DLA |
DLA-3966-1 | pypy3 security update |
Debian DLA |
DLA-3980-1 | python3.9 security update |
EUVD |
EUVD-2020-3159 | 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. |
Fixes
Solution
No solution given by the vendor.
Workaround
No workaround given by the vendor.
References
History
Mon, 03 Nov 2025 22:30:00 +0000
| Type | Values Removed | Values Added |
|---|---|---|
| References |
|
Mon, 14 Jul 2025 13:45:00 +0000
| Type | Values Removed | Values Added |
|---|---|---|
| Metrics |
epss
|
epss
|
Status: PUBLISHED
Assigner: redhat
Published:
Updated: 2025-11-03T21:44:16.139Z
Reserved: 2020-03-20T00:00:00.000Z
Link: CVE-2020-10735
No data.
Status : Modified
Published: 2022-09-09T14:15:08.660
Modified: 2025-11-03T22:15:46.173
Link: CVE-2020-10735
OpenCVE Enrichment
No data.
Debian DLA
EUVD