Lossless Image Encryption Research Articles

Lossless Image Encryption using Robust Chaos-based Dynamic DNA Coding, XORing and Complementing

In this paper, we present a lossless image encryption algorithm utilizing robust chaos based dynamic DNA coding and DNA operations (DNA XOR and DNA Complement). The entire process of encryption is controlled by the pseudo-random number sequences generated through a 1D robust chaos map that exhibits chaotic behaviour in a very large region of parameter space with no apparent periodic window and therefore possesses a fairly large key space. Due to peculiar feed-forward and feedback mechanisms, which modify the synthetic image (created to initiate the encryption process) at the encryption of each pixel, the proposed algorithm possesses extreme sensitivity to the plain image, cipher image and secret key. The performance analysis proves that the proposed algorithm exhibits excellent features (as expected from ideal image encryption algorithms) and is robust against various statistical and cryptanalytic attacks.

Joint Hamming Coding for High Capacity Lossless Image Encryption and Embedding Scheme

Encryption is a widely used solution to prevent privacy leakage and illegal spread when sensitive images are uploaded to cloud storage. Hiding technology also allows confidential data to be embedded into encrypted images for secret communication. As image accuracy without distortion is essential within certain fields (such as medicine and the military), sensitive images must be completely decrypted back into the original images. However, an encrypted image is a noise-like pattern that is meaningless to a user; thus, it is difficult for a user to find the accurate image they desire. Take keywords as search indexes and embed them in encrypted images for encrypted image retrieval as an example. This idea has been extended by Chen and Line’s scheme to achieve higher capacity with reversibility. The proposed scheme adjusts the coding results according to smooth and complex images to increase its hiding capacity. In addition, two thresholds are designed to adjust the predicted pixel value to be close to the original one. Experiments show that compared with the other schemes, the proposed method achieves superior results. In addition, a hidden encrypted image can be extracted from the cover image. Afterward, the hidden secrets can be completely extracted, and sensitive images can also be perfectly restored.

Joint Lossless Image Compression and Encryption Scheme Based on CALIC and Hyperchaotic System.

For efficiency and security of image transmission and storage, the joint image compression and encryption method that performs compression and encryption in a single step is a promising solution due to better security. Moreover, on some important occasions, it is necessary to save images in high quality by lossless compression. Thus, a joint lossless image compression and encryption scheme based on a context-based adaptive lossless image codec (CALIC) and hyperchaotic system is proposed to achieve lossless image encryption and compression simultaneously. Making use of the characteristics of CALIC, four encryption locations are designed to realize joint image compression and encryption: encryption for the predicted values of pixels based on gradient-adjusted prediction (GAP), encryption for the final prediction error, encryption for two lines of pixel values needed by prediction mode and encryption for the entropy coding file. Moreover, a new four-dimensional hyperchaotic system and plaintext-related encryption based on table lookup are all used to enhance the security. The security tests show information entropy, correlation and key sensitivity of the proposed methods reach 7.997, 0.01 and 0.4998, respectively. This indicates that the proposed methods have good security. Meanwhile, compared to original CALIC without security, the proposed methods increase the security and reduce the compression ratio by only 6.3%. The test results indicate that the proposed methods have high security and good lossless compression performance.

Image encryption based on Kronecker product over finite fields and DNA operation

This paper reports an image encryption algorithm based on a matrix of Kronecker products and a deoxyribonucleic acid (DNA) operation over finite fields. First, a plaintext image is mapped from pixel gray-levels to the finite field. Subsequently, the image pixels are scrambled and diffused simultaneously by the Kronecker-product matrix based on a permutation polynomial over finite fields. Finally, a DNA operation is carried out to obtain greater confusion and scrambling. A widespread of security analyses and experimental results show that the proposed algorithm is safe against several common attacks. Moreover, there were no rounding errors in computation over finite fields, thereby ensuring a strict lossless image encryption and decryption. Due to the intrinsic nonlinearity of the permutation polynomials in the finite field, the proposed image encryption system is nonlinear and can resist known-plaintext and chosen-plaintext attacks.

A novel method for lossless image compression and encryption based on LWT, SPIHT and cellular automata

In this paper, a novel method for lossless image encryption based on set partitioning in hierarchical trees and cellular automata. The proposed encryption method embeds the encryption into the compression process, in which a small part of the data is encrypted quickly, while maintaining the good coding characteristics of set partitioning in hierarchical trees (SPIHT). The proposed encryption system adopts three stages of scrambling and diffusion. In each stage of encryption, different chaotic systems are used to generate the plaintext-related key stream to maintain high security and to resist some attacks. Moreover, the channel length of the coded-and-compressed color image is more uncertain, resulting into higher difficulty for attackers to decipher the algorithm. The experimental results indicate that the length of bitstream is compressed to 50% of the original image, showing that our proposed algorithm has higher lossless compression ratio compared with the existing algorithms. Meanwhile, the encryption scheme passes the entropy analysis, sensitivity analysis, lossless recovery test, and SP800-22 test.

A Parallel Processing Technique Based on GMO and BCS for Medical Image Encryption

Image encryption is a technique that provides security to an image and their data from unauthorized access in which there is the lightweight process (LWP) that can be parallelized resulting in the reduction of computation time. In this paper, parallel lossless image encryption, as well as the decryption technique, is proposed. The method is a parallel implementation of group modulo operation (GMO) based bit circular shift (BCS) of pixel bit-plane values. The backbone of this technique is circular bit rotation based on some modulo group key value. The key value used here is the result of group modulo operation. The binary bit values of pixels of the initial Image are rotated circularly to generate a new binary bit value of pixels encrypted image. The enhancement of this GMO and BCS based encryption are also given here by using the parallel implementation of the algorithm. The given results show the parallel implementation technique has the same level of encryption standard but has a better level of the time standard. As discussed in the result section, this technique can be used for medical image encryption as well as in multimedia applications where the transfer of image data is required over a network.

Image encryption based on permutation polynomials over finite fields

In this paper, we propose an image encryption algorithm based on a permutation polynomial over finite fields proposed by the authors. The proposed image encryption process consists of four stages: i) a mapping from pixel gray-levels into finite field, ii) a pre-scrambling of pixels’ positions based on the parameterized permutation polynomial, iii) a symmetric matrix transform over finite fields which completes the operation of diffusion and, iv) a post-scrambling based on the permutation polynomial with different parameters. The parameters used for the polynomial parameterization and for constructing the symmetric matrix are used as cipher keys. Theoretical analysis and simulation demonstrate that the proposed image encryption scheme is feasible with a high efficiency and a strong ability of resisting various common attacks. In addition, there are not any round-off errors in computation over finite fields, thus guaranteeing a strictly lossless image encryption. Due to the intrinsic nonlinearity of permutation polynomials in finite fields, the proposed image encryption system is nonlinear and can resist known-plaintext and chosen-plaintext attacks.

Randomized Key-based GMO-BCS Image Encryption for Securing Medical Image

An essential security requirement while transmitting and receiving medical images is to maintain confidentiality and authorization of these medical images. This paper contains a proposal of an enhanced lossless image encryption algorithm that provides security to Digital Imaging and Communications in Medicine (DICOM) images by producing a random key with using enhanced group modulo based bit circular shift (GMO-BCS) technique. Random key production is the backbone of this technique to provide robust security of medical images that transfer over a network. In the encryption process, we randomly generate a key for each and every pixel of the DICOM image. Group theory is used in this process to create circular shifting in 8-bit pixel values while the security enhancement employs the random key for encryption. This technique is more suitable for medical image encryption either by direct transmission or multimedia app-based transmission under telemedicine and others.

A novel image encryption system merging fractional-order edge detection and generalized chaotic maps

This paper presents a novel lossless image encryption algorithm based on edge detection and generalized chaotic maps for key generation. Generalized chaotic maps, including the fractional-order, the delayed, and the Double-Humped logistic maps, are used to design the pseudo-random number key generator. The generalization parameters add extra degrees of freedom to the system and increase the keyspace achieving more secure keys. Fractional order edge detection filters exhibited better noise robustness than the conventional integer-order ones, rendering the system to be suitable for medical imaging security. The proposed system flexibly integrate different edge detectors, as well as various logistic maps for key generation. The sensitivity of the chaotic maps to all parameters guarantees the encryption system key sensitivity. Security analyses aspects assure the efficiency of the proposed algorithm performance, having high pixel correlation coefficients and flat histograms of cipher images reported. A comparison between the proposed scheme with existing cryptosystems is also presented, regarding histogram uniformity, contrast analysis, Shannon entropy measurements. Compared to the state of the art algorithms, the proposed algorithm has higher statistical and cryptanalytic properties.

A lossless image encryption algorithm using matrix transformations and XOR operation

Encryption is the way to ensure confidentiality of different data, digital images have special features as large data, bulky data, and strong correlation between pixels, which makes traditional encryption algorithms not suitable for image encryption. For this concern, we propose a novel lossless encryption scheme for digital images based on combination of matrix transformations and XOR operation. The numerical experimental results confirms that the proposed method achieves high security level against brute force attacks, statistical attacks and sensitivity analysis, moreover the suggested algorithm provides a good randomness properties, thus our method can be applied for image encryption and transmission in sensitive domains.

A lossless image encryption algorithm using matrix transformations and XOR operation

A lossless image encryption algorithm using matrix transformations and XOR operation

Joint image encryption and compression scheme based on IWT and SPIHT

A joint lossless image encryption and compression scheme based on integer wavelet transform (IWT) and set partitioning in hierarchical trees (SPIHT) is proposed to achieve lossless image encryption and compression simultaneously. Making use of the properties of IWT and SPIHT, encryption and compression are combined. Moreover, the proposed secure set partitioning in hierarchical trees (SSPIHT) via the addition of encryption in the SPIHT coding process has no effect on compression performance. A hyper-chaotic system, nonlinear inverse operation, Secure Hash Algorithm-256(SHA-256), and plaintext-based keystream are all used to enhance the security. The test results indicate that the proposed methods have high security and good lossless compression performance.

A Key Dependent Encryption Algorithm Based on Multiple Bitwise-Shuffling and XOR Variable-Length Partitions

This new algorithm employs shuffling procedures combined with variable-length key-dependent XOR and S-box substitutions to perform lossless image encryption. This algorithm was implemented and tested by performing different permutations of shuffling, XOR encryption and S-box substitution. Empirical analysis using different types of test images of different sizes showed that this new algorithm is effective and resistant to statistical attacks. The idea presented by this algorithm may be generalized to apply to input data other than images and may be combined with other encryption methods.

Algorithm for Image Mixing and Encryption

This new algorithm mixes two or more images of different types and sizes by employing a shuffling procedure combined with S-box substitution to perform lossless image encryption. This combines stream cipher with block cipher, on the byte level, in mixing the images. When this algorithm was implemented, empirical analysis using test images of different types and sizes showed that it is effective and resistant to attacks.