A colour image encryption algorithm using 4-pixel Feistel structure and multiple chaotic systems

Wang, Yao; Zhang, Xiao; Zheng, Zhiming; Qiu, Wangjie

doi:10.1007/s11071-015-1979-3

Cited by 46 publications

(29 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be found that the performance of the proposed algorithm is nearly as good as that of the algorithm in [33]. This can be seen more clearly by comparing it with the algorithms proposed by Wang [27], Murillo-Escobar [28] and Tong [31], all in 2015 and by Wu [36] and Tong [37], both in 2016.…”

Section: Experimental Results and Cryptanalysismentioning

confidence: 63%

“…The results from the all-zero image are shown in Tables 6–8. All results have been compared with algorithms also using 4-pixel Feistel structure [33]. And the test results of white’s, flower’s and mountain’s cipher are shown in Table 9.…”

Section: Experimental Results and Cryptanalysismentioning

confidence: 99%

“…However, unlike [33], the rounded number of the modified structure reduces while changing its twist direction to remain secure.…”

Section: Proposed Algorithmmentioning

confidence: 99%

“…The proposed algorithm by Oztruk et al utilized a Lu-like chaotic system capable of exhibiting both Lorenz-like and Chen-like chaotic system behaviors for different parameter values [32]. We propose an algorithm using 4-pixel Feistel structure and chaotic maps; this algorithm realizes both the security and efficiency needs for a color image [33]. Meanwhile, studies on onset of chaos in discrete nonlinear dynamical systems show potential ways to make selection of chaotic systems and security analysis [34].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure

Wang

Zhang

et al. 2016

PLoS ONE

Self Cite

View full text Add to dashboard Cite

Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two methods are used. First, a simple round function based on a piecewise linear function and tent map are used to reduce computational cost during each iteration. Second, the 4-pixel Feistel structure reduces round number by changing twist direction securely to help the algorithm proceed efficiently. While a large number of simulation experiments prove its security performance, additional special analysis and a corresponding speed simulation show that these two methods increase the speed of the proposed algorithm (0.15s for a 256*256 color image) to twice that of an algorithm with a similar structure (0.37s for the same size image). Additionally, the method is also faster than other recently proposed algorithms.

show abstract

Section: Experimental Results and Cryptanalysismentioning

confidence: 63%

Section: Experimental Results and Cryptanalysismentioning

confidence: 99%

“…However, unlike [33], the rounded number of the modified structure reduces while changing its twist direction to remain secure.…”

Section: Proposed Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure

Wang

Zhang

et al. 2016

PLoS ONE

Self Cite

View full text Add to dashboard Cite

show abstract

“…Over the last few years, many image encryption algorithms based on chaotic maps have been presented [8][9][10].…”

mentioning

confidence: 99%

A Novel Image Encryption Algorithm Based on Multiple Chaotic Systems and Self-adaptive Model

Wang

Xiao

Zheng

2016

Proceedings of the 2015 International Conference on Communications, Signal Processing, and Systems

Self Cite

View full text Add to dashboard Cite

In recent years, image encryption has attracted much attention. Particularly, due to large data capacity and high correlation among pixels, chaos-based image encryption algorithms are more suitable to be applied in the digital image encryption. In this paper, we propose a novel chaotic image encryption algorithm, in which novel multiple chaotic systems and efficient self-adaptive model are initially mingled to enhance the security. Different from conventional algorithms, plaintext participates in the generation of cryptograph in a new way, which follows the idea from the perceptron model. The proposed algorithm enlarges the key space, enhances the randomness of the algorithm, and resists the differential attack effectively. Simulation results are demonstrated that proposed algorithm possesses the high security for the main current attacks, which is an excellent candidate for practical applications of image encryption.

show abstract

Multi‐chaotic maps and blockchain based image encryption

Kumari,

Singh,

Singh

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe vast technological developments make data transmission more frequent over networks. So, the data needs to be secured and for that reason, there is a requirement to develop an effective encryption model. This article proposes a novel image encryption model using multi‐chaotic maps and blockchain (MCBE). Chaotic maps have been used in encryption models as chaotic maps have the properties of randomness, and non‐periodicity that get utilized in improving the efficiency of an encryption model. Logistic and tent maps have been employed as multi‐chaotic maps to make the encryption process effective in this work. A logistic map has a simple structure and is easily implementable but has some drawbacks like small keyspace. Keyspace and randomness are enhanced by using a tent map along with a logistic map. The proposed MCBE methodology applies to grayscale or colored images having different file formats and sizes. Initially, in the confusion phase, the permutation of the original image is performed based on a random permutation that changes the original image pixel's position. The encryption model applies multi‐chaotic maps, row‐wise and column‐wise in the diffusion phase to promote the efficiency of the encryption model. Finally, blockchain has been implemented using the SHA‐256 hash function to obtain the encrypted image that enhances the security by increasing the keyspace, to resist brute force attacks. The evaluation performance of the MCBE has been analyzed against various attacks namely statistical attacks, differential attacks, NIST randomness test, noise, and cropping attacks. The evaluated keyspace is which has high key sensitivity with a correlation of encrypted images close to 0. Maximum achieved entropy value of 7.9998, SSIM value between original and encrypted images nearby 0 confirms the dissimilarity. The Number of Pixels Change Rate (NPCR) value of 99.62%, and the value of Unified Average Changed Intensity (UACI) value of 33.54% are within the specified standard range. The calculated correlation coefficient, NPCR, and UACI values have been compared with the existing algorithms, and the results show that the proposed MCBE methodology has better performance than the other state‐of‐the‐art methods. The experimental results indicate that the chaotic ranges generated by multi‐chaotic maps and the SHA‐256 hash function improve the keyspace and security of the encryption model confirming the efficacy of the proposed model MCBE.

show abstract

A colour image encryption algorithm using 4-pixel Feistel structure and multiple chaotic systems

Cited by 46 publications

References 21 publications

A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure

A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure

A Novel Image Encryption Algorithm Based on Multiple Chaotic Systems and Self-adaptive Model

Multi‐chaotic maps and blockchain based image encryption

Contact Info

Product

Resources

About