Efficient Simplification of Mixed Boolean-Arithmetic Expressions Using E-Graphs

This paper proposes a method to simplify Mixed Boolean-Arithmetic (MBA) expressions using term rewriting techniques with the E-Graph data structure, which can efficiently represent multiple expressions with the same semantics. The approach aims to address the challenges of existing MBA deobfuscation techniques in terms of performance and preserving semantics.