Lucene search

K
osvGoogleOSV:BIT-PYTHON-2020-10735
HistoryMar 06, 2024 - 11:08 a.m.

BIT-python-2020-10735

2024-03-0611:08:16
Google
osv.dev
5
python
algorithms
quadratic time complexity
int function
non-binary bases
system availability
software

7.4 High

AI Score

Confidence

High

0.006 Low

EPSS

Percentile

77.7%

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.

References