Improper input validation in Mit Universal Turing Machine

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). NOTE: the discoverer states "this vulnerability has no real-world implications."

Vulnerability class: Drupalgeddon 2 (CVE-2018-7600)

Published · last modified .

CVSS v3 metric

CVSS v3 base score 7.8 (High). Vector: CVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:H/A:H.

EPSS exploit prediction

EPSS 0.008, 58.7th percentile (scored ); unchanged over 30 days. About EPSS.

Affected products

Weakness classification (CWE)

Public exploits and proof-of-concept code

1 public repository with exploit or proof-of-concept code for this CVE:

  • intrinsic-propensity/turing-machine (79 stars, last pushed 2022-03-28): A Python program implementing and exploiting the Minsky Turing machine considered in the paper "Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing M…

Also mentioned in 11 other repositories (3th1c4l-t0n1/awesome-csirt, ARPSyndicate/cvemon, intrinsic-propensity/intrinsic-propensity.github.io, …). These reference the CVE in a list, notes or a scanner and are not exploit code for it.

References