Open AccessCryptographic algorithm based on pixel shuffling and dynamical chaotic economic map
Author(s) -
Askar Sameh S.,
Karawia Abdelrahman A.,
Alammar Fatmah S.
Publication year - 2018
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2016.0906
Subject(s) - shuffling , key space , pixel , encryption , chaotic , algorithm , cryptography , key (lock) , computer science , entropy (arrow of time) , sensitivity (control systems) , data mining , mathematics , theoretical computer science , artificial intelligence , computer security , programming language , physics , quantum mechanics , electronic engineering , engineering , operating system
In the literature, different types of algorithms that are organised to encrypt and decrypt images have been introduced. Some of these depend on chaotic systems where bifurcation routes to chaos exist. Those algorithms have advantages and disadvantages so far as their security level and computational speed are concerned. This study proposes a robust algorithm based on a pixel shuffling and a one‐dimensional chaotic economic map for encrypting and decrypting images. The proposed algorithm is implemented on many images. The security and performance of the proposed method are analysed thoroughly by using key space, key‐sensitivity, correlation of two adjacent pixels, information entropy, contrast and differential attack. On the basis of the obtained experimental results, the proposed algorithm is characterised by a large size of key space, a high sensitivity to the secret key, very low correlation coefficients, a good information entropy and a high contrast. Finally, the experiments are confirmed that the proposed algorithm can resist statistical and differential attacks with high efficiency.