In the realm of smart communication systems, where the ubiquity of 5G/6G networks and IoT applications demands robust data confidentiality, the cryptographic integrity of block and stream cipher mechanisms plays a pivotal role. This paper focuses on the enhancement of cryptographic strength in these systems through an innovative approach to generating substitution boxes (S-boxes), which are integral in achieving confusion and diffusion properties in substitution–permutation networks. These properties are critical in thwarting statistical, differential, linear, and other forms of cryptanalysis, and are equally vital in pseudorandom number generation and cryptographic hashing algorithms. The paper addresses the challenge of rapidly producing random S-boxes with desired cryptographic attributes, a task notably arduous given the complexity of existing generation algorithms. We delve into the hill climbing algorithm, exploring various cost functions and their impact on computational complexity for generating S-boxes with a target nonlinearity of 104. Our contribution lies in proposing a new cost function that markedly reduces the generation complexity, bringing down the iteration count to under 50,000 for achieving the desired S-box. This advancement is particularly significant in the context of smart communication environments, where the balance between security and performance is paramount.
Nonlinear substitutions (S-boxes) are an important component of modern symmetric cryptography algorithms. They complicate symmetric transformations and introduce nonlinearity in the input-output relationship, which provides resistance to some cryptanalysis techniques. S-boxes generation can be done in a number of ways. However, the most promising are heuristic techniques. On the one hand, the generated S-boxes look like random settings, which complicates algebraic cryptanalysis. On the other hand, heuristic search makes it possible to achieve high nonlinearity and δ-uniformity, which complicates linear and differential cryptanalysis. In this article, we will explore the simplest local search algorithm for generating S-boxes. To assess the efficiency of the algorithm, the concept of a track of a cost function is introduced in the article. We optimize the algorithm parameters and show that with the chosen parameters it is possible to reliably form S-boxes with nonlinearity 104.
Nonlinear substitution boxes (S-boxes) use in most modern symmetric cryptoalgorithms. They are designed to mix input data and take the essential part in ensuring resistance against known cryptoanalytic attacks (differential, linear, algebraic and other methods of cryptoanalysis). However, the random formation of nonlinear substitutions with the required rates is an extremely complex mathematical problem. We observe the heuristic techniques of S-boxes informed search, in particular, we consider the cost function used in most known algorithms (eg, local search, gradient lift, annealing simulation, genetic search, etc.). The purpose of our research is to determine the specific parameters of the heuristic function, which on the one hand do not reduce the degree of awareness of search nodes, and on the other hand do not require significant computational costs. We investigate the influence of individual parameters on the value of the cost function and on the complexity of its calculation. We also provide specific recommendations for the formation of parameters for the heuristic search of S-boxes.
The efficiency of heuristic search algorithms is a critical factor in the realm of cryptographic primitive construction, particularly in the generation of highly nonlinear bijective permutations, known as substitution boxes (S-boxes). The vast search space of 256! (256 factorial) permutations for 8-bit sequences poses a significant challenge in isolating S-boxes with optimal nonlinearity, a crucial property for enhancing the resilience of symmetric ciphers against cryptanalytic attacks. Existing approaches to this problem suffer from high computational costs and limited success rates, necessitating the development of more efficient and effective methods. This study introduces a novel approach that addresses these limitations by dynamically adjusting the cost function parameters within the hill-climbing heuristic search algorithm. By incorporating principles from dynamic programming, our methodology leverages feedback from previous iterations to adaptively refine the search trajectory, leading to a significant reduction in the number of iterations required to converge on optimal solutions. Through extensive comparative analyses with state-of-the-art techniques, we demonstrate that our approach achieves a remarkable 100% success rate in locating 8-bit bijective S-boxes with maximal nonlinearity, while requiring only 50,000 iterations on average—a substantial improvement over existing methods. The proposed dynamic parameter adaptation mechanism not only enhances the computational efficiency of the search process, but also showcases the potential for interdisciplinary collaboration between the fields of heuristic optimization and cryptography. The practical implications of our findings are significant, as the ability to efficiently generate highly nonlinear S-boxes directly contributes to the development of more secure and robust symmetric encryption systems. Furthermore, the dynamic parameter adaptation concept introduced in this study opens up new avenues for future research in the broader context of heuristic optimization and its applications across various domains.
This document describes the principles for building an anonymous decentralized e-voting system. It is proposed to use a ring signature mechanism to ensure anonymity of voters and blockchain technology to ensure the integrity and transparency of the transaction history. Thus, it can be beneficial to use such a combination to ensure the maximal robustness of the systems in the real- world conditions with the persistence of a potential malefactor that is interested to disrupt the work of the system, change the data in some way or influence the processes that are happening inside of the system.