.png){kind=icon}
.png){kind=icon}
Return
An efficient grayscale image encryption scheme based on variable length row-column swapping operations
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-021-11386-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Swapping a row with a row, a column with a column or row with a column are usual operations carried out to scramble the given input plain image. To introduce more complications for the potential hackers, a novel grayscale image encryption scheme using the variable length row-column swapping based scrambling (VLRCSBS) has been proposed in this study. Security of the cipher would be improved in this way. Two chaotic maps, Henon map and piecewise linear chaotic map (PWLCM) have been used. These maps provide three streams of random numbers. Two more streams of random numbers have been created by manipulating the two streams of Henon map. After the grayscale image is input, arbitrary row and column are selected from this image to realize the scrambling effects. A randomly selected vector of pixels from these selected rows and columns is swapped with each other for a number of times. If selected vectors of pixels intersect each other, then to avoid the loss of pixels data, an intersection filter (IF) has been employed to forgo the intersecting vectors of selected pixels from the row and column for swapping. Resultantly, the given image is confused abundantly. An Exclusive-OR(XOR) operation is conducted between the scrambled image and the keystream given by PWLCM to get the final encrypted image. In the previous studies, whole rows and whole columns were swapped with each other. Our study swapped randomly selected portions of the rows and columns for scrambling, which spawned more security. In order to introduce the plaintext sensitivity in the proposed cipher, the hash codes given by the SHA-256 hash function for each input image have been used to update the system parameters and the initial values of the chaotic systems. The value of information entropy attained through the proposed algorithm is 7.9975 which is very competitive. Besides, the simulation and the performance analyses with varied validation metrics express the robustness, defiance to the multifarious threats and potential for some real world application of the cipher.
Keywords:
Chaotic maps
Encryption
Decryption
Swapping
Intersection filter
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W