Efficient and Simple Method for Designing Chaotic S-Boxes

Asim, Muhammad; Jeoti, Varun

doi:10.4218/etrij.08.0207.0188

Cited by 65 publications

(34 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides, Figure 5 depicts the statistical results of the LP of comparison algorithms. These results show that the LP of the proposed S-box is not worse than that of algorithms in [25,26,28,30,32,34,37,38,41]. Furthermore, Table 6 summarizes the above-mentioned evaluating criteria results of the experimental algorithms.…”

Section: Linear Approximation Probability Analysismentioning

confidence: 78%

“…To verify the generated S-box, we analyze its cryptographic criteria and compare it with many other S-boxes designed in [6][7][8][9][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40][41]. Moreover, our experimental environment is i3 CPU 540 3.07 GHz, memory 2.00 GHz Inter Core, Matlab2012b.…”

Section: Cryptographic Criteria Analyses Of Proposed S-boxmentioning

confidence: 99%

See 1 more Smart Citation

Chaotic S‐Box: Intertwining Logistic Map and Bacterial Foraging Optimization

Tian

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

As the unique nonlinear component of block ciphers, Substitution box (S-box) directly affects the safety of a cryptographic system. It is important and difficult to design strong S-box that simultaneously meets multiple cryptographic criteria such as bijection, nonlinearity, strict avalanche criterion (SAC), bit independence criterion (BIC), differential probability (DP), and linear probability (LP). Though many chaotic S-boxes have been proposed, the cryptographic performance of most of them needs to be further improved. A new chaotic S-box based on the intertwining logistic map and bacterial foraging optimization is designed in this paper. It firstly iterates the intertwining logistic map to construct many S-boxes and then applies a bacterial foraging optimization algorithm to find the optimal S-box. Moreover, bacterial foraging optimization algorithm considers the nonlinearity and differential uniformity as the fitness functions in the optimization process. We experiment that the proposed S-box can effectively resist multiple types of cryptanalysis attacks.

show abstract

Section: Linear Approximation Probability Analysismentioning

confidence: 78%

Section: Cryptographic Criteria Analyses Of Proposed S-boxmentioning

confidence: 99%

Chaotic S‐Box: Intertwining Logistic Map and Bacterial Foraging Optimization

Tian

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…l ¼ 2 and f 1 ; f 2 ; f 3 ; f 4 are the bijective chaotic S-boxes from [2,3,15,16], respectively, and if f 5 is the AES S-box, then the S-box from Table 2 is found. In the S-box from [2], error was corrected by replacing the value 14 by 149.…”

Section: Example Of S-box Generated With Proposed Approachmentioning

confidence: 99%

“…In the S-box from [2], error was corrected by replacing the value 14 by 149. Also, in the S-box from [15] error was corrected by replacing the value 242 by 241. These corrections have been made to eliminate repeated values from the S-boxes that influenced their bijective property.…”

Section: Example Of S-box Generated With Proposed Approachmentioning

confidence: 99%

See 1 more Smart Citation

A novel method of S-box design based on chaotic map and composition method

Lambić

2014

Chaos, Solitons & Fractals

109

View full text Add to dashboard Cite

Efficient and secure chaotic S‐Box for wireless sensor network

Zaibi

Peyrard

Kachouri

et al. 2013

Security Comm Networks

View full text Add to dashboard Cite

Information security using chaotic dynamics is a novel topic in the wireless sensor network (WSN) research field. After surveying analog and digital chaotic security systems, we give a state of the art of chaotic S-Box design. The substitution tables are nonlinear maps that strengthen and enhance block crypto-systems. This paper deals with the design of new dynamic chaotic S-Boxes suitable for implementation on wireless sensor nodes. Our proposed schemes are classified into two categories: S-Box based on discrete chaotic map with floating point arithmetic (cascading piecewise linear chaotic map and a three-dimensional map) and S-Box based on discrete chaotic map with fixed-point arithmetic (using discretized Lorenz map and logistic-tent map). The security analysis and implementation process on WSN are discussed. The proposed methods satisfy Good S-Box design criteria and exceed the performance of Advanced Encryption Standard static S-Box in some cases. The energy consumption of different proposals and existing chaotic S-Box designs are investigated via a platform simulator and a real WSN testbed equipped with TI MSP430f1611 micro-controller. The simulations and the experimental results show that our proposed S-Box design with fixed-point arithmetic Lorenz map has the lowest energy-consuming profile compared with the other studied and proposed S-Box design.

show abstract

Efficient and Simple Method for Designing Chaotic S-Boxes

Cited by 65 publications

References 7 publications

Chaotic S‐Box: Intertwining Logistic Map and Bacterial Foraging Optimization

Chaotic S‐Box: Intertwining Logistic Map and Bacterial Foraging Optimization

A novel method of S-box design based on chaotic map and composition method

Efficient and secure chaotic S‐Box for wireless sensor network

Contact Info

Product

Resources

About