A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography (Q1959232)

In this paper, the authors are concerned with the construction of highly nonlinear balanced Boolean functions, in other words the aim is to find a balanced Boolean function featuring a maximal nonlinearity criterion. This problem is reformulated as a deterministic optimization problem. Due to the large dimension of this problem in the practical applications, the classical methods used in combinatorial optimization such as branch and bound, branch and cut, cutting plans, etc. can not be applied and the authors in order to develop robust numerical solution approaches formulate the problem as a polyhedral DC (difference of convex functions) program by using exact penalty techniques and then there is investigated DC programming and DCA (DC optimization algorithms) for solving the related polyhedral DC program. The described computational results show that the DCA is an efficient approach for this problem and it is superior to the standard heuristic approaches developed for the problem.