Obfuscation methods with controlled calculation amounts and table function

Abstract

This paper describes a new obfuscation method with two techniques by which both computational complexity can be controlled and semantic obfuscation can be achieved. The computational complexity can be strictly controlled by using the technique of encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime numbers by length from one second to about one year. Semantic obfuscation is achieved by transforming a function into a table function. A nonlinear, arbitrary function can be incorporated into the functions, while only linear functions are used in the conventional methods. Because the explicit function form is hidden, it is thought that analysis takes time. The computational complexity technique and semantic technique can be used at the same time, and the effect of integrated obfuscation with both techniques is great. Introduction.