{"api_version":"1","generated_at":"2026-04-23T04:33:47+00:00","cve":"CVE-2021-32471","urls":{"html":"https://cve.report/CVE-2021-32471","api":"https://cve.report/api/cve/CVE-2021-32471.json","docs":"https://cve.report/api","cve_org":"https://www.cve.org/CVERecord?id=CVE-2021-32471","nvd":"https://nvd.nist.gov/vuln/detail/CVE-2021-32471"},"summary":{"title":"CVE-2021-32471","description":"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.\"","state":"PUBLIC","assigner":"cve@mitre.org","published_at":"2021-05-10 05:15:00","updated_at":"2021-05-19 18:40:00"},"problem_types":["CWE-20"],"metrics":[],"references":[{"url":"https://github.com/intrinsic-propensity/turing-machine","name":"https://github.com/intrinsic-propensity/turing-machine","refsource":"MISC","tags":[],"title":"GitHub - intrinsic-propensity/turing-machine: 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 Machine\"","mime":"text/html","httpstatus":"200","archivestatus":"404"},{"url":"https://arxiv.org/abs/2105.02124","name":"https://arxiv.org/abs/2105.02124","refsource":"MISC","tags":[],"title":"[2105.02124] Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine","mime":"text/xml","httpstatus":"200","archivestatus":"200"},{"url":"https://www.cve.org/CVERecord?id=CVE-2021-32471","name":"CVE Program record","refsource":"CVE.ORG","tags":["canonical"]},{"url":"https://nvd.nist.gov/vuln/detail/CVE-2021-32471","name":"NVD vulnerability detail","refsource":"NVD","tags":["canonical","analysis"]}],"affected":[],"timeline":[],"solutions":[],"workarounds":[],"exploits":[],"credits":[],"nvd_cpes":[{"cve_year":"2021","cve_id":"32471","vulnerable":"1","versionEndIncluding":"","cpe1":"cpe","cpe2":"2.3","cpe3":"a","cpe4":"mit","cpe5":"universal_turing_machine","cpe6":"-","cpe7":"*","cpe8":"*","cpe9":"*","cpe10":"*","cpe11":"*","cpe12":"*","cpe13":"*"}],"vendor_comments":[],"enrichments":{"kev":null,"epss":null,"legacy_qids":[]},"source_records":{"cve_program":{"CVE_data_meta":{"ASSIGNER":"cve@mitre.org","ID":"CVE-2021-32471","STATE":"PUBLIC"},"affects":{"vendor":{"vendor_data":[{"product":{"product_data":[{"product_name":"n/a","version":{"version_data":[{"version_value":"n/a"}]}}]},"vendor_name":"n/a"}]}},"data_format":"MITRE","data_type":"CVE","data_version":"4.0","description":{"description_data":[{"lang":"eng","value":"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.\""}]},"problemtype":{"problemtype_data":[{"description":[{"lang":"eng","value":"n/a"}]}]},"references":{"reference_data":[{"url":"https://arxiv.org/abs/2105.02124","refsource":"MISC","name":"https://arxiv.org/abs/2105.02124"},{"refsource":"MISC","name":"https://github.com/intrinsic-propensity/turing-machine","url":"https://github.com/intrinsic-propensity/turing-machine"}]}},"nvd":{"publishedDate":"2021-05-10 05:15:00","lastModifiedDate":"2021-05-19 18:40:00","problem_types":["CWE-20"],"metrics":{"baseMetricV3":{"cvssV3":{"version":"3.1","vectorString":"CVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:H/A:H","attackVector":"LOCAL","attackComplexity":"LOW","privilegesRequired":"LOW","userInteraction":"NONE","scope":"UNCHANGED","confidentialityImpact":"HIGH","integrityImpact":"HIGH","availabilityImpact":"HIGH","baseScore":7.8,"baseSeverity":"HIGH"},"exploitabilityScore":1.8,"impactScore":5.9},"baseMetricV2":{"cvssV2":{"version":"2.0","vectorString":"AV:L/AC:L/Au:N/C:C/I:C/A:C","accessVector":"LOCAL","accessComplexity":"LOW","authentication":"NONE","confidentialityImpact":"COMPLETE","integrityImpact":"COMPLETE","availabilityImpact":"COMPLETE","baseScore":7.2},"severity":"HIGH","exploitabilityScore":3.9,"impactScore":10,"acInsufInfo":false,"obtainAllPrivilege":false,"obtainUserPrivilege":false,"obtainOtherPrivilege":false,"userInteractionRequired":false}},"configurations":{"CVE_data_version":"4.0","nodes":[{"operator":"OR","children":[],"cpe_match":[{"vulnerable":true,"cpe23Uri":"cpe:2.3:a:mit:universal_turing_machine:-:*:*:*:*:*:*:*","cpe_name":[]}]}]}},"legacy_mitre":{"record":{"CveYear":"2021","CveId":"32471","Ordinal":"207850","Title":"CVE-2021-32471","CVE":"CVE-2021-32471","Year":"2021"},"notes":[{"CveYear":"2021","CveId":"32471","Ordinal":"1","NoteData":"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.\"","Type":"Description","Title":null},{"CveYear":"2021","CveId":"32471","Ordinal":"2","NoteData":"2021-05-10","Type":"Other","Title":"Published"},{"CveYear":"2021","CveId":"32471","Ordinal":"3","NoteData":"2021-05-10","Type":"Other","Title":"Modified"}]}}}