Obfuscation Algorithms Based on Congruence Equation and Knapsack Problem

Abstract

This paper proposes an obfuscation algorithm based on congruence equation and knapsack problem, for the problem of generating opaque predicate in control flow obfuscation. We binarize the state of the solution of the congruence equation, and then combine the knapsack problem to achieve the binary output of opaque predicate. Compared with the existing chaotic opaque predicate design algorithm, the experimental comparison shows that this paper generates the probability of opaque predicate binary results is nearly 50%, and the time overhead is controlled within 1 s. The experimental results show that the proposed algorithm has better performance in randomness, stability and time overhead, which can effectively resist code reverse analysis.