Novel permutation measures for image encryption algorithms

Abd-El-Hafiz, Salwa K.; AbdElHaleem, Sherif H.; Radwan, Ahmed G.

doi:10.1016/j.optlaseng.2016.04.023

Cited by 32 publications

(13 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To recover the permutation position array X , we select a special color plain image P = [1,2,3,4,5,6,7,8,9,10,11,12] and obtain the corresponding cipher image C = [240, 44,45,220,207,217,89 , 211, 132, 239, 53, 58] by using Pak's encryption machine. Then we can obtain its intermediary ciphertext array C according to Equation (5) as C = [211, 132, 239, 53, 58, 240, 44, 45, 220, 207, 217, 89].…”

Section: Examples Of the Improved Cryptanalysis Schemementioning

confidence: 99%

“…Then we can obtain its intermediary ciphertext array C according to Equation (5) as C = [211, 132, 239, 53, 58, 240, 44, 45, 220, 207, 217, 89]. Then we can obtain the permutated pixel array P from D by using Equation 4, that is, P = [10,8,2,3,9,11,4,5,12,6,7,1]. By comparing P and P , the permutation array X is recovered as X = [10,8,2,3,9,11,4,5,12,6,7,1].…”

Section: Examples Of the Improved Cryptanalysis Schemementioning

confidence: 99%

“…Based on a typical model, researchers have tried many different ways of improving innovation. Some studies have proposed different image permutation strategies [6][7][8][9][10][11][12]. Some researchers have proposed novel image diffusion techniques [10,[13][14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps

Zhu

Wang

Sun

2018

Entropy

View full text Add to dashboard Cite

This paper presents an improved cryptanalysis of a chaos-based image encryption scheme, which integrated permutation, diffusion, and linear transformation process. It was found that the equivalent key streams and all the unknown parameters of the cryptosystem can be recovered by our chosen-plaintext attack algorithm. Both a theoretical analysis and an experimental validation are given in detail. Based on the analysis of the defects in the original cryptosystem, an improved color image encryption scheme was further developed. By using an image content–related approach in generating diffusion arrays and the process of interweaving diffusion and confusion, the security of the cryptosystem was enhanced. The experimental results and security analysis demonstrate the security superiority of the improved cryptosystem.

show abstract

Section: Examples Of the Improved Cryptanalysis Schemementioning

confidence: 99%

Section: Examples Of the Improved Cryptanalysis Schemementioning

confidence: 99%

See 1 more Smart Citation

Improved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps

Zhu

Wang

Sun

2018

Entropy

View full text Add to dashboard Cite

show abstract

“…Hence the cryptosystems based on chaotic systems mainly suffer from key size requirements [Alvarez & Li, 2006, Kelber & Schwarz, 2007, Rhouma et al, 2010, Solak et al, 2010, Ozkaynak and Ozer, 2016. Despite above mentioned drawback of having a reduced key space, the chaotic systems have been a preferred choice [Patidar et al, 2011, Wang and Xu, 2015, Wu et al, 2016, Abd-El-Hafiz et al, 2016, Farajallah et al, 2016 for the image encryption systems due to their features: ergodicity, mixing property, sensitivity to initial conditions/system parameters, etc. having close resemblance with the ideal cryptographic properties: confusion, diffusion, balance, avalanche properties, etc.…”

Section: Introductionmentioning

confidence: 99%

A Novel Quasigroup Substitution Scheme for Chaos Based Image Encryption

Patidar¹,

Purohit²

2018

JAND

View full text Add to dashboard Cite

A novel quasigroup substitution scheme for chaos based image encryption During last two decades, there has been a prolific growth in the chaos based image encryption algorithms. Up to an extent these algorithms have been able to provide an alternative to exchange large media files (images and videos) over the networks in a secure way. However, there have been some issues with the implementation of chaos based image ciphers in practice. One of them is reduced/small key space due to the fact that chaotic behavior is only observed for certain range of system parameters/initial conditions of the chaotic system used in such algorithms. To overcome this difficulty, we propose a simple, efficient and robust image encryption algorithm based on combined applications of quasigroups and chaotic standard map.The proposed image cipher is based on the Shannon's popular substitution-diffusion architecture where a quasigroup of order 256 and chaotic standard map have been used for the substitution and permutation of image pixels respectively. Due to the introduction of quasigroup as part of the secret key along with the parameter and initial conditions of the chaotic standard map, the key space has been increased significantly. The proposed image cipher is very fast due to the fact that the substitution based on the quasigroup operations is very simple and can be executed easily through the lookup table operations on Latin squares (which are Cayley operation tables of quasigroups) and the permutation is performed row-by-row as well as column-by-column using the pseudo random number sequences generated through the chaotic standard map. The security and performance have been analyzed through the histograms, correlation coefficients, information entropy, key sensitivity analysis, differential analysis, key space analysis etc. and the results prove the efficiency and robustness of the proposed image cipher against the possible security threats.

show abstract

“…Initial values and system parameters of the chaotic system were calculated first. Abd-El-Hafiz et al 20 proposed two measures for the evaluation permutation skills. Two parameters were proposed in the program.…”

Section: Introductionmentioning

confidence: 99%

Chaotic image encryption scheme using two-by-two deoxyribonucleic acid complementary rules

Sun

2017

Opt. Eng

View full text Add to dashboard Cite

Shuliang Sun, "Chaotic image encryption scheme using two-by-two deoxyribonucleic acid complementary rules," Opt. Eng. 56(11), 116117 (2017), doi: 10.1117/1.OE.56.11.116117. Abstract. An image encryption technique has been proposed using deoxyribonucleic acid (DNA) operations and chaotic map in this scheme. First, initial conditions of row encryption and column encryption are calculated. Then, a two-dimensional sine iterative chaotic map with infinite collapse (ICMIC) modulation map (2D-SIMM) is adopted to produce chaotic sequences. Extended exclusive OR (XOR) is executed to enhance security. A mask matrix is produced by 2D-SIMM. It performs XOR operation with the DNA-encoded matrix. Finally, the revised DNA-encoded matrix is performed two-by-two DNA complementary rules and executed DNA decoding to obtain the cipher image. Experiment results prove that the proposed scheme is secure enough and can resist various attacks. © The Authors. Published by SPIE under a Creative Commons Attribution 3.0 Unported License. Distribution or reproduction of this work in whole or in part requires full attribution of the original publication, including its DOI.

show abstract

Novel permutation measures for image encryption algorithms

Cited by 32 publications

References 33 publications

Improved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps

Improved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps

A Novel Quasigroup Substitution Scheme for Chaos Based Image Encryption

Chaotic image encryption scheme using two-by-two deoxyribonucleic acid complementary rules

Contact Info

Product

Resources

About