True-chaotic substitution box based on Boolean functions

Abstract

With the exponential increase in communication sector, the risk of information management also increases. Although there is enormous input from the cybersecurity perspective, still a lot must be done. The substitution box is the most vital component in symmetric encryption algorithms, and various proposals have been presented using chaos. Unfortunately, the full potential of chaos in constructing substitution boxes has not been exploited before. In this paper, we have constructed strong and robust substitution boxes based on Boolean functions incorporating chaos. First, we have developed a new algebraic structure based on the Boolean functions. Second, we have incorporated logistic chaotic map with the proposed algebraic structure to construct strong and robust true-chaotic S-Boxes. Third, the constructed S-Boxes are tested against statistical and security analysis including linear and differential cryptanalysis to demonstrate their strength and robustness. The simulation results and analysis demonstrated that the constructed substitution boxes can resist well-known attacks. Finally, we have done the comparative analysis for statistical, security and cryptanalysis with other well-known works to demonstrate the superiority of our work.