Journal
VISUAL COMPUTER
Volume 38, Issue 3, Pages 1027-1050Publisher
SPRINGER
DOI: 10.1007/s00371-021-02066-w
Keywords
Color image encryption; Fractional Hartley transform; Chaos; Substitution; Permutation
Categories
Ask authors/readers for more resources
The proposed method of color image encryption utilizes compound chaotic mappings, fractional Hartley transformation and piecewise linear chaotic map for substitution, optical processing and permutation of image pixels. It enhances security by combining optical transformation and chaos-based substitution and permutation processes. The scheme is lossless and symmetric, providing high sensitivity to keys and resistance to various forms of attacks.
We propose a novel opto-digital method of color image encryption which utilizes compound chaotic mappings, the reality preserving fractional Hartley transformation and piecewise linear chaotic map for substitution, optical processing and permutation of image pixels, respectively. The image to be encrypted initially undergoes a chaos-based substitution in the spatial domain through the compound chaotic maps followed by a transformation to the combined time-frequency domain using the fractional Hartley transform. A reality preserving version of the fractional Hartley transform is used to eliminate the complexity associated with transform coefficients. Optical transformation of the image, in the fractional Hartley domain, is followed by a permutation through piecewise linear chaotic maps. Due to the intertwined application of optical transformation and chaos-based substitution and permutation processes, the proposed image encryption scheme possesses higher security. The input parameters (initial conditions, control parameters, and number of iterations) of chaotic maps along with fractional orders of the fractional Hartley transform collectively form the secret keys for encryption/decryption. The proposed scheme is a lossless and symmetric encryption scheme. The level of security provided in terms of high sensitivity to keys, resistivity to brute-force attack, classical attacks, differential attacks, entropy attack, noise and occlusion attack along with the elimination of complex coefficients proves its better efficacy as compared to other similar state-of-the-art schemes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available