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

Abstract

The 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.

A novel SM4 cryptographic architecture against higher order power analysis attacks

“…10 Secret merchant-4 (SM4) [11][12][13][14][15][16][17][18][19][20] and advanced encryption standard (AES) cryptographic algorithms 5,6 are a type of symmetric block ciphers that are able to achieve fast encryption speeds and low hardware implementation costs. 4,[21][22][23][24][25] Unfortunately, both SM4 and AES cryptographic algorithms are pretty vulnerable to PAAs when they are implemented in hardware levels. 4,26 So as to reinforce the security levels of SM4 and AES cryptographic circuits against PAAs, a variety of countermeasures [27][28][29] have been proposed to break the critical correlation between the processed data and monitored power dissipation.…”

A high‐speed and low‐latency hardware implementation of RC4 cryptographic algorithm

“…In contrast, digest cryptographic algorithms such as message digest‐5 (MD5), 1 SM3, 4 secure hash algorithm‐1 (SHA1), 7 SHA2, 3 and SHA3 2 typically utilize hash functions to build one‐to‐one relationships from the input data to the output data. Unlike asymmetric cryptographic algorithms and digest cryptographic algorithms, symmetric cryptographic algorithms 8–10 can be used for encrypting/decrypting a large number of private data efficiently since the same secret key is presented during the encryption/decryption process.…”

“…Software‐implemented RC4 cryptographic algorithm is widely applied in the areas of network security and information security due to its low computational complexity, fast encryption speed, and high security against malicious attacks. However, when RC4 is implemented on hardware, its throughput is significantly lower than the corresponding throughput of hardware‐implemented block ciphers such as advanced encryption standard (AES), 11 data encryption standard (DES), 9 and SM4 4 . Moreover, the latency of RC4 is pretty high 19,20 .…”

“…There exists a lot of lightweight cryptographic algorithms such as AES, 11 SM4, 4 3DES, 9 PRESENT, 27 and ASCON 28 in the cryptography. However, these cryptographic algorithms all belong to block ciphers.…”

An Analysis Tool for Cryptographic Designs Based on Chaotic Systems

“…In other words, chaotic systems have been used as an entropy source and this entropy source has been transformed into cryptographic primitives such as image encryption schema [2,5,6,7,8], hash functions [9,10], s-box designs [11,12] and key generators with the help of a protocol [13][14][15][16][17]. Again, random numbers and bits have been generated with FPGA using chaos-based maps in studies in the literature [18][19][20].…”