A new S-box construction method meeting strict avalanche criterion

Li, Lang; Liu, Jinggen; Guo, Ying; Liu, Bo-Tao

doi:10.1016/j.jisa.2022.103135

Cited by 11 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After testing the independence of the round key, we also need to test the sensitivity of the key expansion algorithm to the initial key, which manifests as a strict avalanche effect. A strict avalanche effect means that any bit of the initial key is reversed, with a 50% probability for every bit of the round key [28]. We reverse the 1 bit of the initial key in Table 2, apply the key expansion algorithm to obtain 10 round keys, and for each round, calculate the Hamming distance between the corresponding round keys, and the results are shown in Table 3.…”

Section: Strict Avalanche Criterionmentioning

confidence: 99%

Application of high performance one-dimensional chaotic map in key expansion algorithm

2023

Preprint

View full text Add to dashboard Cite

In this paper, we present a key expansion algorithm based on a high-performance one-dimensional chaotic map. Traditional one-dimensional chaotic maps exhibit several limitations, prompting us to construct a new map that overcomes these shortcomings. By analyzing the structural characteristics of classic 1D chaotic maps, we propose a high-performance 1D map that outperforms multidimensional maps introduced by numerous researchers in recent years. In block cryptosystems, the security of round keys is of utmost importance. To ensure the generation of secure round keys, a sufficiently robust key expansion algorithm is required. The security of round keys is assessed based on statistical independence and sensitivity to the initial key. Leveraging the properties of our constructed high-performance chaotic map, we introduce a chaotic key expansion algorithm. Our experimental results validate the robust security of our proposed key expansion algorithm, demonstrating its resilience against various attacks. The algorithm exhibits strong statistical independence and sensitivity to the initial key, further strengthening the security of the generated round keys.

show abstract

Section: Strict Avalanche Criterionmentioning

confidence: 99%

Application of high performance one-dimensional chaotic map in key expansion algorithm

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…When the Avalanche Eect is considered, an algorithm may have signicant encryption strength but still be vulnerable to attack if intruders identify weak components. The Strict Avalanche Criterion (SAC) is also calculated using the Avalanche Eect [54]. SAC is passed if the encryption strength from the Avalanche Eect is between 45% and 55%; otherwise, the algorithm fails the SAC criterion [54].…”

Section: A Why Des?mentioning

confidence: 99%

“…The Strict Avalanche Criterion (SAC) is also calculated using the Avalanche Eect [54]. SAC is passed if the encryption strength from the Avalanche Eect is between 45% and 55%; otherwise, the algorithm fails the SAC criterion [54].…”

Section: A Why Des?mentioning

confidence: 99%

An Application of the Khumbelo Function on the Camellia Algorithm to Prevent Attacks in IoT Devices

Muthavhine,

Sumbwanyambe

2023

IEEE Access

View full text Add to dashboard Cite

Camellia is an encryption algorithm implemented in many Internet of Things (IoT) devices. However, intruders attack the Camellia cipher using Substitution Box (S-Box) distinguishers. The distinguishers are tables that provide probabilities for guessing the secret keys of the algorithms. Distinguishers are used in the majority of attacks. The most wellknown distinguishers are Linear Approximation Table (LAT), Dierence-Distribution Table (DDT), and Dierential-Linear Connectivity Table (DLCT). This research focuses on preventing these attacks using a novel function called the Khumbelo function to distract the construction of S-Box distinguishers. The Khumbelo function distracted the distinguishers' constructions by reducing the probability of building the table. The Khumbelo function successfully decreased the attack probability of LAT (from 54.6875 percent to 0 percent), DDT (from 1.5625 percent to 0 percent), and DLCT (from 50.0000 percent to 0 percent). The Khumbelo function is generated using a 4-Byte output S-Box instead of the original 1-Byte output S-Box in Camellia. INDEX TERMS Camellia, Cryptographic Attacks, Internet of Things (IoT), IoT devices, K_Camellia, S-Box, The Khumbelo Function. I. INTRODUCTION T HE Internet of Things (IoT) is a modern critical system that connects devices, things, individuals, objects, digital machines, computers, and objects for the transmission of information [1]. IoT is emerging as an eective technique with devices in signicant elds to create unique networks [1] [2]. IoT customers use these networks depending on the task needed at that time, [3]. Companies use IoT devices and networks to exchange top secret and condential information, [4]. Some of this information is sent unencrypted or encrypted by algorithms that are vulnerable to attacks [4].Cryptographic algorithms are primarily used to ensure security and privacy [4]. One of the cryptographic algorithms used on IoT devices is Camellia. This study shows that dierent types of IoT devices use Camellia. Some S-Box-based cryptographic algorithms are compromised on IoT devices, including Camellia and Advanced Encryption Standard (AES). An S-Box, for example, could resist or allow attacks. Assume an S-Box with less than 32 output bits, such as in Camellia and AES, which have eight output bits [5]. In that case, intruders could easily construct dierent distinguishers to get the probability of guessing the encryption key. Camellia and AES share some similarities in that all S-Boxes in these two algorithms are built using similar transformations that take the multiplicative inverse over a nite eld, and they are all 8 x 8 in size [5]. Therefore, if an intruder could attack one S-Box, all S-Boxes would be vulnerable. According to the ndings of this study, these S-Boxes are vulnerable to various attacks. Cryptographic algorithms are unavoidable, but they must be designed in advance to withstand attacks [4].The existing studies show that intruders attack the Camellia algorithm with various attack methods. For instance:i. Camellia is vu...

show abstract

“…In the literature review, it is seen that the current cryptosystem design studies, in which confusion/diffusion and SAC tests are carried out, perform their tests without certain statistical proofs and hypothesis form. Another notable feature is the term confusion/diffusion that is mostly used for hash functions [6][7][8][9], and the term SAC that is mostly used for s-box designs [10][11][12][13]. There are many test methods in the literature that provide randomness analysis on bit values and sequences, but they are not current studies.…”

Section: Literaturementioning

confidence: 99%

“…It is not possible to include all these studies in this article, but the case studies are given in the range of Ref. [6][7][8][9][10][11][12][13]. These studies did not focus on how close an 𝑛𝑛-bit output is to a change in the ratio of 1/2, its statistical significance and acceptability.…”

Section: Introductionmentioning

confidence: 99%

SAAC - Kriptosistemlerin analizi için istatistiksel mutlak çığ-etkisi kriter testi

BAYSAN>

Özekes

2022

ECJSE

View full text Add to dashboard Cite

Cryptosystems using binary radix (bit) arrays must first meet the strict avalanche criterion, which prevents correlation between input and output values in order to resist differential attacks. For this criterion, which is also called confusion/diffusion and butterfly-effect in the common literature, it is expected that two inputs with only one-bit difference from each other will cause half the total number of bits to differ in the output bits. While the literature includes the difference of at least half of the output bits, it does not include that changing all the bits will cause the binary complement and thus another undesirable result. The Statistical Absolute Avalanche Criterion (SAAC) test proposed in this study allows the statistical determination of a lower limit and the establishment of hypotheses. The SAAC test is a tool that can be easily used in the analysis of cryptosystems, especially encryption methods and message hash functions.

show abstract

A new S-box construction method meeting strict avalanche criterion

Cited by 11 publications

References 15 publications

Application of high performance one-dimensional chaotic map in key expansion algorithm

Application of high performance one-dimensional chaotic map in key expansion algorithm

An Application of the Khumbelo Function on the Camellia Algorithm to Prevent Attacks in IoT Devices

SAAC - Kriptosistemlerin analizi için istatistiksel mutlak çığ-etkisi kriter testi

Contact Info

Product

Resources

About