Construction of 1-resilient Boolean functions with good cryptographic properties via genetic tabu search algorithm

In this paper, through combining the advantages of genetic algorithm and tabu search algorithm, a new algorithm called genetic tabu search (GTS) to obtain even-variable Boolean functions satisfying all the needed criteria: strictly almost optimal (SAO) nonlinearity, 1-resiliency, optimal algebraic degree, low autocorrelation, and optimal (or suboptimal) algebraic immunity is presented. It is shown that the proposed algorithm can achieve a better tradeoff among multiple cryptographic criteria than those of the previous research results.