Deconstructing Obfuscation: A four-dimensional framework for evaluating Large Language Models assembly code deobfuscation capabilities
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have shown promise in software engineering, yet their effectiveness for binary analysis remains unexplored. We present the first comprehensive evaluation of commercial LLMs for assembly code deobfuscation. Testing seven state-of-the-art models against four obfuscation scenarios (bogus control flow, instruction substitution, control flow flattening, and their combination), we found striking performance variations--from autonomous deobfuscation to complete failure. We propose a theoretical framework based on four dimensions: Reasoning Depth, Pattern Recognition, Noise Filtering, and Context Integration, explaining these variations. Our analysis identifies five error patterns: predicate misinterpretation, structural mapping errors, control flow misinterpretation, arithmetic transformation errors, and constant propagation errors, revealing fundamental limitations in LLM code processing.We establish a three-tier resistance model: bogus control flow (low resistance), control flow flattening (moderate resistance), and instruction substitution/combined techniques (high resistance). Universal failure against combined techniques demonstrates that sophisticated obfuscation remains effective against advanced LLMs. Our findings suggest a human-AI collaboration paradigm where LLMs reduce expertise barriers for certain reverse engineering tasks while requiring human guidance for complex deobfuscation. This work provides a foundation for evaluating emerging capabilities and developing resistant obfuscation techniques.x deobfuscation. This work provides a foundation for evaluating emerging capabilities and developing resistant obfuscation techniques.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 59 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
25 of 59 references.
References · 25
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2022Survey of Hallucination in Natural Language Generationcited by 2,075
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
- 2020CodeBERT: A Pre-Trained Model for Programming and Natural Languagescited by 1,310
- 2023A Survey on Evaluation of Large Language Modelscited by 1,242
- 2022CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesiscited by 885
13 more
- 2023WizardCoder: Empowering Code Large Language Models with Evol-Instructcited by 733
- 2022The Stack: 3 TB of permissively licensed source codecited by 359
- 2023RepoBench: Benchmarking Repository-Level Code Auto-Completion Systemscited by 353
- 2023CodeT5+: Open Code Large Language Models for Code Understanding and Generationcited by 333
- 2024AutoCodeRover: Autonomous Program Improvementcited by 278
- 2017A Survey of Machine Learning for Big Code and Naturalnesscited by 221
- 2022Large Language Models Meet NL2Code: A Surveycited by 138
- 2021DOBF: A Deobfuscation Pre-Training Objective for Programming Languagescited by 68
- 2024LLM4Decompile: Decompiling Binary Code with Large Language Modelscited by 39
- 2024Robustness, Security, Privacy, Explainability, Efficiency, and Usability of Large Language Models for Codecited by 28
- 2022Beyond the C: Retargetable Decompilation using Neural Machine Translationcited by 15
- 2023Evaluating and Explaining Large Language Models for Code Using Syntactic Structurescited by 9
- 2022Automatically Recommend Code Updates: Are We There Yet?cited by 7
Built on by
Citing papers per year: 2026: 2.
2 papers.