An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps

Chen, Guo; Chen, Yong; Liao, Xiaofeng

doi:10.1016/j.chaos.2005.10.022

Cited by 191 publications

(84 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(17) to calculate differential approximation probability of the generated S-box, shown in Table 5. And comparing with the results of literatures [9][10][11][12][14][15][16][17][18][19][20], shown in the DP column of Table 6, the results show that the maximum value of differential approximation probability of the S-box of LLCMLM is only 10, the minimum is 4, which means that the generated S-box has a good ability to resist differential cryptanalysis. Table 5.…”

Section: Differential Approximation Probability Of the S-box Of Llcmlmmentioning

confidence: 75%

“…To validate the LLCMLM, we compare it with the algorithms in literatures [9][10][11][12][14][15][16][17][18][19][20], respectively. And our experimental environment is Inter Core i3 CPU 540 3.07 GHz, memory 2.00 GHz.…”

Section: S-box Performance Analysismentioning

confidence: 99%

“…Furthermore, literature [11] proposed an S-box design approach based on iteration discrete chaotic. Literature [12] developed an S-box generating method using three-dimensional chaotic Baker map.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

S-box: L-L Cascade Chaotic Map and Line Map

Tian

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Being as an important nonlinear component of block ciphers, Substitution box (S-box) directly affect the security of the cryptographic systems. It is important and difficult to design cryptographically strong S-box that simultaneously meet with multiple cryptographic criteria such as bijection, non-linearity, strict avalanche criterion (SAC), bits independence criterion (BIC), differential probability (DP) and linear probability (LP). To address the issue, an S-box generation approach based on L-L cascade Chaotic Map and Line Map (LLCMLM) is proposed in this paper. L-L cascade chaotic map is used to generate an integer sequence ranging 0-255, and line map is applied to scramble the position of the integer sequence. A series of experiments have been conducted to compare multiple cryptographic criteria of LLCMLM with other algorithms. Simulation results indicate that LLCMLM meets well with the design criteria of the S-box.

show abstract

Section: Differential Approximation Probability Of the S-box Of Llcmlmmentioning

confidence: 75%

Section: S-box Performance Analysismentioning

confidence: 99%

See 1 more Smart Citation

S-box: L-L Cascade Chaotic Map and Line Map

Tian

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…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%

“…Furthermore, literature [8] proposed an S-box design approach based on iteration discrete chaotic that had high immunity to the differential cryptanalysis. Using three-dimensional chaotic Baker map, literature [9] constructed an S-box that approximately fulfilled all the criteria for a cryptographically strong S-box.…”

Section: Mathematical Problems In Engineeringmentioning

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

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

A chaotic map‐based anonymous multi‐server authenticated key agreement protocol using smart card

Tsai

2014

Int J Communication

View full text Add to dashboard Cite

Summary Authenticated key agreement protocols play an important role for network‐connected servers to authenticate remote users in Internet environment. In recent years, several authenticated key agreement protocols for single‐server environment have been developed based on chaotic maps. In modern societies, people usually have to access multiple websites or enterprise servers to accomplish their daily personal matters or duties on work; therefore, how to increase user's convenience by offering multi‐server authentication protocol becomes a practical research topic. In this study, a novel chaotic map‐based anonymous multi‐server authenticated key agreement protocol using smart card is proposed. In this protocol, a legal user can access multiple servers using only a single secret key obtained from a trusted third party, known as the registration center. Security analysis shows this protocol is secure against well‐known attacks. In addition, protocol efficiency analysis is conducted by comparing the proposed protocol with two recently proposed schemes in terms of computational cost during one authentication session. We have shown that the proposed protocol is twice faster than the one proposed by Khan and He while preserving the same security properties as their protocol has. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps

Cited by 191 publications

References 12 publications

S-box: L-L Cascade Chaotic Map and Line Map

S-box: L-L Cascade Chaotic Map and Line Map

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

A chaotic map‐based anonymous multi‐server authenticated key agreement protocol using smart card

Contact Info

Product

Resources

About