S-Box Based Image Encryption Application Using a Chaotic System without Equilibrium

Çavuşoğlu, Ünal; Kaçar, Sezgin; Akgül, Akif; Pham, Viet–Thanh; Jafari, Sajad; Alsaadi, Fawaz E.; Nguyen, Xuan Quynh

doi:10.3390/app9040781

Cited by 112 publications

(71 citation statements)

References 63 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, algorithms based on chaos need more steps for generating one iteration if the chaotic systems are based on ordinary differential equations (ODEs) instead of mappings. References [4,6,15,36,39] are based on ODEs which imply more computational operations to solve the systems than references [2,3,9,10,35,38,40] based on iterated maps. It would be unfair to compare the computational time between these algorithms that all of them generate good S-boxes.…”

Section: Performance Comparationmentioning

confidence: 99%

“…In recent years, many papers have been reported and focus on studying cryptosystems based on chaos, see ref. [3][4][5][6][7][8][9][10][11][12][13][14][15][16], this is, because of the relationships that exists between the chaotic system properties and the cryptosystem properties. In ref.…”

Section: Introductionmentioning

confidence: 99%

“…[18] the algorithm is built via time-delay series. Other types of encryption algorithms consider so-called hidden attractors [15]. e advantage of using discrete chaotic dynamical systems is that from one iteration to another, the elements of the time series are uncorrelated.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Generation of Dynamical S-Boxes for Block Ciphers via Extended Logistic Map

Cassal-Quiroga

Campos-Cantón

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In this work, we present a simple algorithm to design n × n-bits substitution boxes (S-boxes) based on chaotic time series of the logistic map for different carrying capacities. e use of different carrying capacities in the chaotic map leads to low computational complexity, which is desirable to get high-speed communication systems. We generate a main sequence by means of two auxiliary sequences with uniform distribution via the logistic map for different carrying capacities. e elements of the main sequence are useful for generating the elements of an S-box. e auxiliary sequences are generated by considering lag time chaotic series; this helps to hide the chaotic map used. e U-shape distribution of logistic chaotic map is also avoided, in contrast with common chaos-based schemes without considering lag time chaotic series, and uncorrelated S-box elements are obtained. e proposed algorithm guarantees the generation of strong S-boxes that fulfill the following criteria: bijection, nonlinearity, strict avalanche criterion, output bits independence criterion, criterion of equiprobable input/output XOR distribution, and maximum expected linear probability. Finally, an application premised on polyalphabetic ciphers principle is developed to obtain a uniform distribution of the plaintext via dynamical S-boxes.

show abstract

Section: Performance Comparationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Generation of Dynamical S-Boxes for Block Ciphers via Extended Logistic Map

Cassal-Quiroga

Campos-Cantón

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…With the rapid development of network communication and big data applications, information security has become a more and more popular topic. Scholars have proposed a variety of information security technologies, including information encryption [1][2][3][4][5], watermarking [6,7], privacy protection [8][9][10], and so on. Among them, cryptography is the most basic technology in information security.…”

Section: Introductionmentioning

confidence: 99%

A Novel S-Box Design Algorithm Based on a New Compound Chaotic System

Zhu

Wang

2019

Entropy

View full text Add to dashboard Cite

Substitution-boxes (S-Boxes) are important non-linear components in block cryptosystem, which play an important role in the security of cryptosystems. Constructing S-Boxes with a strong cryptographic feature is an important step in designing block cipher systems. In this paper, a novel algorithm for constructing S-Boxes based on a new compound chaotic system is presented. Firstly, the new chaotic system, tent–logistic system, is proposed, which has better chaotic performance and wider chaotic range than the tent and logistic system, and can not only increase the randomness of the chaotic sequences but also expand the key space of cryptosystems. Secondly, a novel linear mapping is employed to construct the initial S-Box. Then, the permutation operation on the initial S-Box is performed by using chaotic sequence generated with the tent–logistic system, which improves the cryptographic features of the S-Box. The idea behind the proposed work is to make supplementary safe S-box. Detail tests for cryptographic strength of the proposed S-Box are performed by using different standard benchmarks. The test results and performance analysis show that our proposed S-Box has very smaller values of linear probability (LP) and differential probability (DP) and a satisfactory average value of nonlinearity compared with other S-Boxes, showing its excellent application potential in block cipher system.

show abstract

“…These features make the traditional encryption algorithms such as data encryption standard (DES), advanced encryption standard (AES), and Rivest-Shamir-Adleman (RSA) unsatisfactory. Thus, plenty of new encryption methods have been developed based on various technologies, such as chaos [2][3][4][5], compressed sensing [6,7], wave transmission [8,9], hash function [10,11], deoxyribonucleic acid coding [12,13], genetics [14], gray code [15], elliptical curve [16], and so on. Among them, the chaos-based image encryption schemes have received extensive attention due to the advantages of chaotic systems.…”

Section: Introductionmentioning

confidence: 99%

A Tweak-Cube Color Image Encryption Scheme Jointly Manipulated by Chaos and Hyper-Chaos

2019

View full text Add to dashboard Cite

This paper proposes a novel tweak-cube color image encryption scheme jointly manipulated by chaos and hyper-chaos. One-dimensional (1D) chaotic maps are effortless to operate, but the key space is relatively small. The hyperchaotic system has complex dynamics properties, which are capable of compensating for the defects of 1D chaotic maps. Thus, we first raise an improved 1D chaotic map with an increased key space. Then, we associate it with a four-dimensional (4D) hyperchaotic system to generate the key streams and further rotate and shift the rows and columns of each component of Red (R), Green (G), and Blue (B) for the color image. The permuting mode is to disturb the original position of the pixels by mimicking the way of twisting the Rubik’s cube. Moreover, the key stream updated by the plain images is also utilized for diffusion and scramble at the bit level. As a consequence, our cryptosystem enhances the security without at the expense of increasing time cost.

show abstract

S-Box Based Image Encryption Application Using a Chaotic System without Equilibrium

Cited by 112 publications

References 63 publications

Generation of Dynamical S-Boxes for Block Ciphers via Extended Logistic Map

Generation of Dynamical S-Boxes for Block Ciphers via Extended Logistic Map

A Novel S-Box Design Algorithm Based on a New Compound Chaotic System

A Tweak-Cube Color Image Encryption Scheme Jointly Manipulated by Chaos and Hyper-Chaos

Contact Info

Product

Resources

About