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."

CVSS v3 7.8 HIGH
CVSS v2.0 7.2 HIGH

7.8^/10

CVSS v3 : HIGH

Vector :

Exploitability : 1.8 / Impact : 5.9

Attack Vector LOCAL

Attack Complexity LOW

Privileges Required LOW

User Interaction NONE

Confidentiality Impact HIGH

Integrity Impact HIGH

Availability Impact HIGH

Scope UNCHANGED

7.2^/10

CVSS v2.0 : HIGH

Vector : AV:L/AC:L/Au:N/C:C/I:C/A:C

Exploitability : 3.9 / Impact : 10.0

Access Vector LOCAL

Access Complexity LOW

Authentication NONE

Confidentiality Impact COMPLETE

Integrity Impact COMPLETE

Availability Impact COMPLETE

References

Link	Resource
https://arxiv.org/abs/2105.02124	Third Party Advisory
https://github.com/intrinsic-propensity/turing-machine	Exploit Third Party Advisory
https://arxiv.org/abs/2105.02124	Third Party Advisory
https://github.com/intrinsic-propensity/turing-machine	Exploit Third Party Advisory

Configurations

Configuration 1 (hide)

cpe:2.3:a:mit:universal_turing_machine:-:*:*:*:*:*:*:*

History

21 Nov 2024, 06:07

Type	Values Removed	Values Added
References	~~() https://arxiv.org/abs/2105.02124 - Third Party Advisory~~	() https://arxiv.org/abs/2105.02124 - Third Party Advisory
References	~~() https://github.com/intrinsic-propensity/turing-machine - Exploit, Third Party Advisory~~	() https://github.com/intrinsic-propensity/turing-machine - Exploit, Third Party Advisory

Information

Published : 2021-05-10 05:15

Updated : 2024-11-21 06:07

NVD link : CVE-2021-32471

Mitre link : CVE-2021-32471

CVE.ORG link : CVE-2021-32471

JSON object : View

Products Affected

mit

universal_turing_machine

CWE

CWE-20

Improper Input Validation

{"id": "CVE-2021-32471", "metrics": {"cvssMetricV2": [{"type": "Primary", "source": "nvd@nist.gov", "cvssData": {"version": "2.0", "baseScore": 7.2, "accessVector": "LOCAL", "vectorString": "AV:L/AC:L/Au:N/C:C/I:C/A:C", "authentication": "NONE", "integrityImpact": "COMPLETE", "accessComplexity": "LOW", "availabilityImpact": "COMPLETE", "confidentialityImpact": "COMPLETE"}, "acInsufInfo": false, "impactScore": 10.0, "baseSeverity": "HIGH", "obtainAllPrivilege": false, "exploitabilityScore": 3.9, "obtainUserPrivilege": false, "obtainOtherPrivilege": false, "userInteractionRequired": false}], "cvssMetricV31": [{"type": "Primary", "source": "nvd@nist.gov", "cvssData": {"scope": "UNCHANGED", "version": "3.1", "baseScore": 7.8, "attackVector": "LOCAL", "baseSeverity": "HIGH", "vectorString": "CVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:H/A:H", "integrityImpact": "HIGH", "userInteraction": "NONE", "attackComplexity": "LOW", "availabilityImpact": "HIGH", "privilegesRequired": "LOW", "confidentialityImpact": "HIGH"}, "impactScore": 5.9, "exploitabilityScore": 1.8}]}, "published": "2021-05-10T05:15:06.640", "references": [{"url": "https://arxiv.org/abs/2105.02124", "tags": ["Third Party Advisory"], "source": "cve@mitre.org"}, {"url": "https://github.com/intrinsic-propensity/turing-machine", "tags": ["Exploit", "Third Party Advisory"], "source": "cve@mitre.org"}, {"url": "https://arxiv.org/abs/2105.02124", "tags": ["Third Party Advisory"], "source": "af854a3a-2127-422b-91ae-364da2661108"}, {"url": "https://github.com/intrinsic-propensity/turing-machine", "tags": ["Exploit", "Third Party Advisory"], "source": "af854a3a-2127-422b-91ae-364da2661108"}], "vulnStatus": "Modified", "weaknesses": [{"type": "Primary", "source": "nvd@nist.gov", "description": [{"lang": "en", "value": "CWE-20"}]}], "descriptions": [{"lang": "en", "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.\""}, {"lang": "es", "value": "Una comprobaci\u00f3n insuficiente de la entrada en la implementaci\u00f3n de Marvin Minsky 1967 de Universal Turing Machine, permite a usuarios del programa ejecutar c\u00f3digo arbitrario por medio de datos dise\u00f1ados. Por ejemplo, un cabezal de cinta puede tener una ubicaci\u00f3n inesperada despu\u00e9s del procesamiento de una entrada compuesta por As y Bs (en lugar de 0s y 1s). NOTA: el descubridor afirma que \"this vulnerability has no real-world implications\""}], "lastModified": "2024-11-21T06:07:06.180", "configurations": [{"nodes": [{"negate": false, "cpeMatch": [{"criteria": "cpe:2.3:a:mit:universal_turing_machine:-:*:*:*:*:*:*:*", "vulnerable": true, "matchCriteriaId": "04D42862-0472-4012-A7C3-F93085B6F5C2"}], "operator": "OR"}]}], "sourceIdentifier": "cve@mitre.org"}