A new S-box generator algorithm based on chaos and cellular automata

S-boxes are very important structures for encryption algorithms. For S-boxes to be strong, they should not be as linear as possible. Obtaining an S-box with high nonlinearity is a difficult problem. For this reason, it has attracted the attention of researchers for many years. In this study, cellular automata logic was used to overcome this problem. A chaotic tent map was used for the initial population. Then, in this weak S-box, the elements were replaced with their neighbors, and the nonlinearity value was checked. When this value increased, the S-box was transferred to the next generation. With the proposed algorithm, an S-box structure with a nonlinearity value of 110.5 was obtained. This value surpasses most studies in the literature. In addition, it has been proven because of the analysis that the proposed S-box also provides other performance criteria.