scholarly journals Thermal Image Encryption Based on Region of Interest (ROI) and Chaotic map

2018 ◽  
Vol 7 (3) ◽  
pp. 1944
Author(s):  
Lokesh B S ◽  
Dr. Manjunatha M B

Most of the thermal image information concentrated on a particular region and 50% of image information stored in Most Significant Bit (MSB) plane. Based on these two strategy, proposed an thermal image encryption based on region of interest (ROI) and chaotic map. Firstly extract the MSB bit plane of thermal input image. This  MSB bit plane undergo ROI calculation method. This method involves the partition of MSB bit plane into several 16*16 blocks. Apply the thresholding function to each block to separate the ROI blocks. Then selected part from input thermal image undergo XOR operation between random image generated from chaotic map. For lossless decryption at the receiver side, embedded the index of ROI blocks using LSB embedding algorithm. Simulation results shows the proposed algorithm achieves good security and more efficiency.

2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Zhenjun Tang ◽  
Ye Yang ◽  
Shijie Xu ◽  
Chunqiang Yu ◽  
Xianquan Zhang

Image encryption is a useful technique of image content protection. In this paper, we propose a novel image encryption algorithm by jointly exploiting random overlapping block partition, double spiral scans, Henon chaotic map, and Lü chaotic map. Specifically, the input image is first divided into overlapping blocks and pixels of every block are scrambled via double spiral scans. During spiral scans, the start-point is randomly selected under the control of Henon chaotic map. Next, image content based secret keys are generated and used to control the Lü chaotic map for calculating a secret matrix with the same size of input image. Finally, the encrypted image is obtained by calculating XOR operation between the corresponding elements of the scrambled image and the secret matrix. Experimental result shows that the proposed algorithm has good encrypted results and outperforms some popular encryption algorithms.


2017 ◽  
Vol 28 (05) ◽  
pp. 1750069 ◽  
Author(s):  
Xiuli Chai ◽  
Zhihua Gan ◽  
Yang Lu ◽  
Yiran Chen ◽  
Daojun Han

A novel image encryption algorithm using the chaotic system and deoxyribonucleic acid (DNA) computing is presented. Different from the traditional encryption methods, the permutation and diffusion of our method are manipulated on the 3D DNA matrix. Firstly, a 3D DNA matrix is obtained through bit plane splitting, bit plane recombination, DNA encoding of the plain image. Secondly, 3D DNA level permutation based on position sequence group (3DDNALPBPSG) is introduced, and chaotic sequences generated from the chaotic system are employed to permutate the positions of the elements of the 3D DNA matrix. Thirdly, 3D DNA level diffusion (3DDNALD) is given, the confused 3D DNA matrix is split into sub-blocks, and XOR operation by block is manipulated to the sub-DNA matrix and the key DNA matrix from the chaotic system. At last, by decoding the diffused DNA matrix, we get the cipher image. SHA 256 hash of the plain image is employed to calculate the initial values of the chaotic system to avoid chosen plaintext attack. Experimental results and security analyses show that our scheme is secure against several known attacks, and it can effectively protect the security of the images.


Electronics ◽  
2018 ◽  
Vol 7 (11) ◽  
pp. 326 ◽  
Author(s):  
Shouliang Li ◽  
Benshun Yin ◽  
Weikang Ding ◽  
Tongfeng Zhang ◽  
Yide Ma

Considering that a majority of the traditional one-dimensional discrete chaotic maps have disadvantages including a relatively narrow chaotic range, smaller Lyapunov exponents, and excessive periodic windows, a new nonlinearly modulated Logistic map with delay model (NMLD) is proposed. Accordingly, a chaotic map called a first-order Feigenbaum-Logistic NMLD (FL-NMLD) is proposed. Simulation results demonstrate that FL-NMLD has a considerably wider chaotic range, larger Lyapunov exponents, and superior ergodicity compared with existing chaotic maps. Based on FL-NMLD, we propose a new image encryption algorithm that joins the pixel plane and bit-plane shuffle (JPB). The simulation and test results confirm that JPB has higher security than simple pixel-plane encryption and is faster than simple bit-plane encryption. Moreover, it can resist the majority of attacks including statistical and differential attacks.


Author(s):  
Naveenkumar S K ◽  
Panduranga H T ◽  
Kiran P

Image information security plays a vital role in computing and communication technologies. This paper describes a new concept of expand and shrink to enhance the strength of chaos based image encryption technique. This method consists of both permutations as well as substitution process for image scrambling and encryption. In permutation plain image is shuffled using chaos technique. Input image undergo two times chaos permutation in-between expand and shrink process leads to substitution. Permutation decreases the correlation between the pixel and substitution increases the entropy of encrypted image. Proposed encryption technique works for both gray-scale and color image. From the experiment highly scrambled image is obtained at the end of encryption process. Decryption process employs exactly reverse process of encryption which results in the reconstructed images.


2018 ◽  
Vol 28 (11) ◽  
pp. 1850132 ◽  
Author(s):  
Manjit Kaur ◽  
Vijay Kumar

In this paper, an efficient image encryption technique using beta chaotic map, nonsubsampled contourlet transform, and genetic algorithm is proposed. Initially, the nonsubsampled contourlet transform is utilized to decompose the input image into subbands. The beta chaotic map is used to develop pseudo-random key that encrypts the coefficients of subbands. However, it requires certain parameters to encrypt these coefficients. A multiobjective fitness function for genetic algorithm is designed to find the optimal parameter of beta chaotic map. The inverse of nonsubsampled contourlet transform is performed to obtain a ciphered image. The performance of the proposed technique is compared with recently developed well-known meta-heuristic based image encryption techniques. Experimental results reveal that the proposed technique provides better computational speed and high encryption intensity. The comparative analyses show effectiveness of the proposed image encryption technique.


2014 ◽  
Vol 65 (2) ◽  
pp. 90-96 ◽  
Author(s):  
Xiaopeng Wei ◽  
Bin Wang ◽  
Qiang Zhang ◽  
Chao Che

Abstract In recent years, there has been growing interesting in image encryption based on chaotic maps and wavelet transform. In this paper, a novel scheme for image encryption based on chaotic maps and reversible integer wavelet transform is proposed. Firstly, the cipher key which is related to plain-image is used to generate different parameters and initial values of chaotic maps. Then the plain-image is permuted by the order from chaotic maps, and processed by integer wavelet transform. A part of transform coefficient is diffused by the orbits of chaotic maps. Finally, the cipher image is obtained by inverse integer wavelet transform based on the diffused coefficient. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security than previous works, which is suitable for protecting the image information.


2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.


Chaotic systems behavior attracts many researchers in the field of image encryption. The major advantage of using chaos as the basis for developing a crypto-system is due to its sensitivity to initial conditions and parameter tunning as well as the random-like behavior which resembles the main ingredients of a good cipher namely the confusion and diffusion properties. In this article, we present a new scheme based on the synchronization of dual chaotic systems namely Lorenz and Chen chaotic systems and prove that those chaotic maps can be completely synchronized with other under suitable conditions and specific parameters that make a new addition to the chaotic based encryption systems. This addition provides a master-slave configuration that is utilized to construct the proposed dual synchronized chaos-based cipher scheme. The common security analyses are performed to validate the effectiveness of the proposed scheme. Based on all experiments and analyses, we can conclude that this scheme is secure, efficient, robust, reliable, and can be directly applied successfully for many practical security applications in insecure network channels such as the Internet


Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 421
Author(s):  
Dariusz Puchala ◽  
Kamil Stokfiszewski ◽  
Mykhaylo Yatsymirskyy

In this paper, the authors analyze in more details an image encryption scheme, proposed by the authors in their earlier work, which preserves input image statistics and can be used in connection with the JPEG compression standard. The image encryption process takes advantage of fast linear transforms parametrized with private keys and is carried out prior to the compression stage in a way that does not alter those statistical characteristics of the input image that are crucial from the point of view of the subsequent compression. This feature makes the encryption process transparent to the compression stage and enables the JPEG algorithm to maintain its full compression capabilities even though it operates on the encrypted image data. The main advantage of the considered approach is the fact that the JPEG algorithm can be used without any modifications as a part of the encrypt-then-compress image processing framework. The paper includes a detailed mathematical model of the examined scheme allowing for theoretical analysis of the impact of the image encryption step on the effectiveness of the compression process. The combinatorial and statistical analysis of the encryption process is also included and it allows to evaluate its cryptographic strength. In addition, the paper considers several practical use-case scenarios with different characteristics of the compression and encryption stages. The final part of the paper contains the additional results of the experimental studies regarding general effectiveness of the presented scheme. The results show that for a wide range of compression ratios the considered scheme performs comparably to the JPEG algorithm alone, that is, without the encryption stage, in terms of the quality measures of reconstructed images. Moreover, the results of statistical analysis as well as those obtained with generally approved quality measures of image cryptographic systems, prove high strength and efficiency of the scheme’s encryption stage.


Sign in / Sign up

Export Citation Format

Share Document