Heuristic Methods for the Design of Cryptographic Boolean Functions

Abstract

In this article, heuristic methods of hill climbing for cryptographic Boolean functions satisfying the required properties of balance, nonlinearity, autocorrelation, and other stability indicators are considered. A technique for estimating the computational efficiency of gradient search methods, based on the construction of selective (empirical) distribution functions characterizing the probability of the formation of Boolean functions with indices of stability not lower than required, is proposed. As an indicator of computational efficiency, an average number of attempts is proposed to be performed using a heuristic method to form a cryptographic Boolean function with the required properties. Comparative assessments of the effectiveness of the heuristic methods are considered. The results of investigations of the cryptographic properties of the formed Boolean functions in comparison with the best known assessments are given. On the basis of the conducted research, it can be concluded that the functions constructed in accordance with the developed method have high persistence indexes and exceed the known functions by these indicators.

Enhancing Smart Communication Security: A Novel Cost Function for Efficient S-Box Generation in Symmetric Key Cryptography

“…Algorithms such as Genetic Algorithms (GAs) [21][22][23], Simulated Annealing (SA) [17,18], and Hill Climbing [12,15,35] have been extensively applied to generate Sboxes that fulfill specific cryptographic criteria. These methods, characterized by their iterative search processes and flexibility in handling complex optimization problems, offer a dynamic approach to S-box design, contrasting with the static nature of algebraic and combinatorial constructions [36,37].…”