scholarly journals IMAGE ENCRYPTION IN BLOCK-WISE WITH MULTIPLE CHAOTIC MAPS FOR PERMUTATION AND DIFFUSION

2016 ◽  
Vol 06 (03) ◽  
pp. 1220-1227 ◽  
Author(s):  
Gopalakrishnan T. ◽  
◽  
Ramakrishnan S. ◽  
Author(s):  
Mona F. M. Mursi ◽  
Hossam Eldin H. Ahmed ◽  
Fathi E. Abd El-Samie ◽  
Ayman H. Abd El-Aziem

In this paper, the authors propose an image encryption scheme based on the development of a Hénon chaotic map using fractional Fourier transform (FRFT) which is introduced to satisfy the necessity of high secure image. This proposed algorithm combines the main advantages of confusion and diffusion with (FRFT), it use Arnold Cat map for confusion and Hénon chaotic map or one of the proposed Hénon chaotic maps for diffusion. The proposed algorithm is compared with some image encryption algorithms based on Arnold Cat map, Baker chaotic map, Hénon chaotic map and RC6. The authors perform a comparison between them in several experimental tests as statistical analyses, processing time and security analysis. The authors find from these comparison tests that the proposed algorithm demonstrates good result even better than RC6 and other chaotic maps in some cases.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-23 ◽  
Author(s):  
Ibrahim Yasser ◽  
Fahmi Khalifa ◽  
Mohamed A. Mohamed ◽  
Ahmed S. Samrah

Chaos-based encryption algorithms offer many advantages over conventional cryptographic algorithms, such as speed, high security, affordable overheads for computation, and procedure power. In this paper, we propose a novel perturbation algorithm for data encryption based on double chaotic systems. A new image encryption algorithm based on the proposed chaotic maps is introduced. The proposed chaotification method is a hybrid technique that parallels and combines the chaotic maps. It is based on combination between Discrete Wavelet Transform (DWT) to decompose the original image into sub-bands and both permutation and diffusion properties are attained using the chaotic states and parameters of the proposed maps, which are then concerned in shuffling of pixel and operations of substitution, respectively. Security, statistical test analyses, and comparison with other techniques indicate that the proposed algorithm has promising effect and it can resist several common attacks. Namely, the average values for UACI and NPCR metrics were 33.6248% and 99.6472%, respectively. Additionally, unscrambling quality can fulfill security and execution prerequisites as evidenced by PSNR (9.005955) and entropy (7.999275) values. In sum, the proposed method has enough ability to achieve low residual intelligibility with high quality recovered data, high sensitivity, and high security performance compared to some other recent literature approaches.


Optik ◽  
2016 ◽  
Vol 127 (7) ◽  
pp. 3541-3545 ◽  
Author(s):  
Bin Wang ◽  
Yingjie Xie ◽  
Changjun Zhou ◽  
Shihua Zhou ◽  
Xuedong Zheng

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 52277-52291
Author(s):  
Mujeeb Ur Rehman ◽  
Arslan Shafique ◽  
Sohail Khalid ◽  
Iqtadar Hussain

2011 ◽  
Vol 3 (2) ◽  
pp. 181-194 ◽  
Author(s):  
G.A Sathishkumar ◽  
K Bhoopathy bagan ◽  
N Sriraam

Sign in / Sign up

Export Citation Format

Share Document