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.
{
"versions": [
{
"introduced": "3.7.0"
},
{
"fixed": "3.7.14"
},
{
"introduced": "3.8.0"
},
{
"fixed": "3.8.14"
},
{
"introduced": "3.9.0"
},
{
"fixed": "3.9.14"
},
{
"introduced": "3.10.0"
},
{
"fixed": "3.10.7"
},
{
"introduced": "0"
},
{
"last_affected": "3.11.0-rc1"
}
]
}[
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-alpha1"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-alpha2"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-alpha3"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-alpha4"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-alpha5"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-alpha6"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-alpha7"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-beta1"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-beta2"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-beta3"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-beta4"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.11.0-beta5"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "3.0.0"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "35"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "36"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "37"
}
]
},
{
"events": [
{
"introduced": "0"
},
{
"last_affected": "8.0"
}
]
}
]
"https://storage.googleapis.com/cve-osv-conversion/osv-output/CVE-2020-10735.json"