Abstract

Image scrambling is a process to convert a meaningful image into an unidentifiable or an unordered image by changing the pixel position such that an unauthorized user should not be able to access the original contents. The paper summarizes the various chaotic maps based scrambling methods with their performance measures. The discussion focuses on the scrambling techniques like Arnold map, Affine map, Baker map, Henon map, Logistic map, Fibonacci sequence, Fibonacci-Lucas sequence, and Fibonacci P-code transformation used to shuffle the image pixels in various image encryption algorithms. Each scrambling method is observed by using the adjacent pixels correlation coefficient, NPCR and UACI, scrambling/unscrambling speed, mean value analysis, entropy and peak signal-noise ratio. A comparative table is used to represent the reasonable computational outcome of each analysis parameter. The relative analysis of the performance and security measure highlights the weakness and strength of discussing scrambling techniques and can be used in the case-based image cryptosystem in future research.

Details

Title
A Review of Image Scrambling Technique Using Chaotic Maps
Author
Agarwal, Shafali
Pages
77-98
Section
Articles
Publication year
2018
Publication date
Mar 30, 2018
Publisher
Taiwan Association of Engineering and Technology Innovation
ISSN
22235329
e-ISSN
2226809X
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2206306931
Copyright
© 2018. This work is published under http://creativecommons.org/licenses/by-nc/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.