Abstract
This paper presents a new chaos-based image cipher using a plaintext-related permutation. The cat map and Lorenz system are employed to shuffle the positions of image pixels and generate the diffusion keystream, respectively. The control parameters of the cat map, i.e. the permutation key, are determined by the Murmur2 hash value of the original image. Owing to the avalanche property of hash functions, completely different shuffled images will be produced even if there is a tiny difference between the original ones, and it helps accelerate the diffusion process. Experimental results indicate that the proposed scheme requires only one and two cipher cycles to achieve an acceptable and a satisfactory diffusion properties, respectively, whereas two and three cipher cycles are needed by typical schemes to achieve the same properties. Thorough security analysis is carried out, and the results demonstrate the satisfactory security of the proposed scheme.
Highlights
Image encryption technologies have drawn much attention over the past decade or so to meet the increasing demand for secure image communications over public networks
Owing to the avalanche property of hash functions, completely different shuffled images will be produced even if there is a tiny difference between the original ones
The key of the proposed cryptosystem is composed of two parts: the permutation key contributed by the control parameters (p, q) of the cat map and the diffusion key contributed by the initial conditions (x0, y0, z0) of the Lorenz system
Summary
Image encryption technologies have drawn much attention over the past decade or so to meet the increasing demand for secure image communications over public networks. The chaos-based ones suggest a promising direction owing to their optimal trade-off between security and. The iterative permutation-diffusion operations, suggested by Shannon for secure ciphers constructions, are widely adopted in chaos-based image ciphers. A direct way to improve the efficiency of chaos-based image ciphers is reducing the number of iterations required by keystream generation, for instance, reducing the overall cipher cycles or the required keystream length. In [9], Wang et al proposed a fast image encryption algorithm that combines the permutation and diffusion stages so that the pixel values are changed while the image blocks are being relocated. The image needs to be scanned only once in each encryption round, while conventional schemes separate the permutation and diffusion stages require at least two imagescanning processes.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Networked and Distributed Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
