Lucene search
K

7 matches found

RedhatCVE
RedhatCVE
added 2025/05/22 7:44 p.m.8 views

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

7.8CVSS7.7AI score0.00849EPSS
Exploits1References1
NVD
NVD
added 2021/05/10 5:15 a.m.24 views

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

7.8CVSS0.00849EPSS
Exploits1References2
Prion
Prion
added 2021/05/10 5:15 a.m.20 views

Input validation

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

7.2CVSS7.8AI score0.00849EPSS
Exploits1References2
Cvelist
Cvelist
added 2021/05/10 4:49 a.m.31 views

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

8AI score0.00849EPSS
Exploits1References2
CVE
CVE
added 2021/05/10 4:49 a.m.209 views

CVE-2021-32471

CVE-2021-32471 concerns the Marvin Minsky 1967 Universal Turing Machine implementation, where insufficient input validation in the program allows a user to execute arbitrary code via crafted data. The described scenario notes that, after processing input composed of As and Bs (rather than 0s and ...

7.8CVSS7.8AI score0.00849EPSS
In wildExploits1References2Affected Software1
ATTACKERKB
ATTACKERKB
added 2021/05/10 12:0 a.m.95 views

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

7.8CVSS7.9AI score0.00849EPSS
In wildExploits1References3
CNNVD
CNNVD
added 2021/05/10 12:0 a.m.8 views

Universal Turing Machine Marvin Minsky 输入验证错误漏洞

Universal Turing Machine is a computational model. Provides a simulation of any Turing Machine function on any input. A security vulnerability exists in Universal Turing Machine Marvin Minsky 1967. The vulnerability stems from insufficient validation of user input by the program, which could allo...

7.8CVSS7.9AI score0.00849EPSS
Exploits1References3
Rows per page
Query Builder