FPGA simulation of chaotic tent map‐based S‐Box design

Abstract

AbstractThe chaotic system has a characteristically random behavior by nature, and these systems have their own characteristics in a completely deterministic structure. This feature of a chaotic system makes it difficult to predict encryptions designed based on such a system. Thanks to this unpredictable and strong feature, maps produced from chaotic systems are an important alternative in the field of encryption. One of the structures obtained by employing chaotic maps is the substitution box. S‐Box, which provides the confusion principle used in block ciphers, is the main block that dynamically replaces unencrypted data with confidential data and makes a significant contribution to ensuring high security in the encryption system. Therefore, S‐Boxes hold a critical role in block ciphers. Speed and reliability are important parameters in the creation of this main block. Especially, applications performed on hardware are more reliable and high performance. Therefore, in this study, an S‐Box was designed using field‐programmable gate arrays (FPGA) simulation from a chaotic tent map to create a fast and reliable S‐Box because FPGAs offer solutions that may be important in this field considering their fast and customizable architecture. In the proposed method, the S‐Box was created in 0.16 s. In addition, the dynamic properties of the chaotic tent map were analyzed with Lyapunov exponents, and the NIST SP 800‐22 test was applied for the information encryption suitability of the proposed chaotic system. Also, to test the reliability of the produced S‐Box structures, SAC, non‐linearity, bit independence criteria, and input/output XOR distribution table metrics were implemented. The results showed that the proposed chaotic map was dynamic and passed the reliability tests successfully.