A novel method of S-box design based on discrete chaotic maps and cuckoo search algorithm

Alhadawi, Hussam S.; Majid, Mazlina Abdul; Lambić, Dragan; Ahmad, Musheer

doi:10.1007/s11042-020-10048-8

Cited by 95 publications

(44 citation statements)

References 71 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The LAP score of 0.125 is also slightly better than many Sboxes such as [8,23,45,48,50,[52][53][54][55][56]60,64,65]. But, S-boxes presented in [35,47,58,59,61,62] show better LAP than our S-boxes. Absence of fixed points is also another significant criterion to assess the security strength of S-boxes.…”

Section: Comparative Analysismentioning

confidence: 61%

“…Therefore, the proposed method involves the nonlinearity improvisation plan as the technique for evolving preliminary S-box for over all nonlinearity feature of the S-box. Table 3 makes it evident that the proposed S-box has considerably higher nonlinearity performance over many recently investigated S-boxes in [8,24,[46][47][48][49][50][51][52][53][54][55][56][57][58][59][60][63][64][65]. The excellent nonlinearity performance over many existing studies demonstrates that the proposed method is fairly effective in making the high nonlinear transformation of plaintext to ciphertext as compared to other methods.…”

Section: Comparative Analysismentioning

confidence: 91%

“…In literature, many studies have been investigated through innovative methods to produce S-boxes having nonlinearity. Many S-box methods are lacking one or more sanctuary canons like static permutation method [35], use of irreducible polynomial of static nature [61,35], presence of fixed points [23,34,47,51,[57][58][59][60][61][62], high computational cost [23,35] etc. Our proposed method for the construction of S-box engages simple, pioneering, and linear trigonometric transformation (LTT) along with a novel and dynamic nonlinearity improvisation plan.…”

Section: Comparative Analysismentioning

confidence: 99%

“…The proposed S-boxes doesn't have any fixed points. But, a number of S-box found to have 1 or more fixed points as in [8,23,45,47,48,51,[56][57][58][59][60][61][62][63][64][65].…”

Section: Comparative Analysismentioning

confidence: 99%

See 3 more Smart Citations

Efficient Dynamic S-Box Generation Using Linear Trigonometric Transformation for Security Applications

et al. 2021

Self Cite

View full text Add to dashboard Cite

Protection of data transmitted over the network from illegal access is one of the major challenges being posed by exponential growth of data in online digital communication. Modern cryptosystems assist in data sanctuary by utilizing substitution-boxes (S-boxes). This paper presents a modest and novel technique to erect dynamic and key dependent S-boxes with the help of a novel linear trigonometric transformation. A new optimization plan is also suggested to improvise the nonlinearity characteristic of the preliminary S-box generated through trigonometric transformation. The proposed technique has the competence to create significant quantity of cryptographic strong S-boxes with the help of projected scheme. A specimen S-box is procreated, and standard performance criteria is applied to appraise the cryptographic strength of the resultant S-box and other known S-boxes available in the literature. Comparative performance analyses validate the noteworthy contribution of the proposed scheme for the generation of dynamic and secure S-boxes. An image privacy preserving scheme based on the proposed Sbox is also suggested to validate the fact that it holds strong candidature for modern cryptosystems to protect multimedia data.

show abstract

Section: Comparative Analysismentioning

confidence: 61%

Section: Comparative Analysismentioning

confidence: 91%

Section: Comparative Analysismentioning

confidence: 99%

“…The proposed S-boxes doesn't have any fixed points. But, a number of S-box found to have 1 or more fixed points as in [8,23,45,47,48,51,[56][57][58][59][60][61][62][63][64][65].…”

Section: Comparative Analysismentioning

confidence: 99%

See 2 more Smart Citations

Efficient Dynamic S-Box Generation Using Linear Trigonometric Transformation for Security Applications

et al. 2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the case of an 8 × 8 S-box, the bijectivity analysis was performed when the introduced S-box consisted of different output values within an interval of [0,255] [39]. This finding provided a clear proof that the proposed S-box has passed the bijective requirement.…”

Section: Bijectivitymentioning

confidence: 86%

DS2B: Dynamic and Secure Substitution Box for Efficient Speech Encryption Engine

et al. 2021

View full text Add to dashboard Cite

This paper proposes an efficient encryption technique based on Dynamic and Secure Substitution Box (DS2B) design suitable for IoT and resource-constrained platforms. The DS2B has the advantages of simple structure and good encryption performance. A different number of strong S-boxes could be generated with minor variations in the DS2B parameters. Performance analyses of the DS2B, including differential/linear cryptanalysis, bijective, nonlinearity, strict avalanche criterion (SAC), and bit independence criterion (BIC) have been presented where high nonlinearity, and low differential uniformity are achieved. Besides, a comparison with recent S-boxes is introduced which shows the robustness of the DS2B. To verify the DS2B, a speech encryption engine was realized on FPGA. Various security analyses were evaluated including the National Institute of Standards & Technology (NIST) statistical test suite, number of samples changes rate NSCR, mean square error (MSE), correlation, histogram, and spectrogram. In this work, the silence periods are encrypted in a way that makes them much harder to detect using the DS2B. The proposed encryption scheme achieved a throughput of 9.87 G bit/s, which is higher than previous work. A Xilinx Nexys 4 FPGA evaluation board was used for implementing and verifying the design.

show abstract

Chaotic Particle Swarm Optimization Based on Meeting Room Approach for Designing Bijective S-Boxes

Alhadawi

Salih

Salman

2021

Proceedings of International Conference on Emerging Technologies and Intelligent Systems

Self Cite

View full text Add to dashboard Cite

This paper proposed a modified and enhanced multi-swarm Particle Swarm Optimization algorithm based on Meeting Room Approach (MPSO) with Tent Logistic map. The proposed modified MPSO algorithm was used to generate strong 8 Â 8 substitution boxes (S-Box) while a Chaotic Tent map was used to update the velocities of each leader in the meeting room to improve their movements and enhance the exploration capability of the MPSO. The generated S-box was validated using cryptographic performance evaluation criteria, such as nonlinearity, bijectivity, strict avalanche criteria, bit independence criteria, differential probability, and linear approximation probability. The obtained results showed that the proposed algorithm performed better than some of the state-of-the-art algorithms and proved its capability against cryptanalysis attacks.

show abstract

A novel method of S-box design based on discrete chaotic maps and cuckoo search algorithm

Cited by 95 publications

References 71 publications

Efficient Dynamic S-Box Generation Using Linear Trigonometric Transformation for Security Applications

Efficient Dynamic S-Box Generation Using Linear Trigonometric Transformation for Security Applications

DS2B: Dynamic and Secure Substitution Box for Efficient Speech Encryption Engine

Chaotic Particle Swarm Optimization Based on Meeting Room Approach for Designing Bijective S-Boxes

Contact Info

Product

Resources

About