scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A novel triple-image encryption and hiding algorithm based on chaos, compressive sensing and 3D DCT

TL;DR: A novel triple-image encryption and hiding algorithm is proposed by combining a 2D chaotic system, compressive sensing (CS) and the 3D discrete cosine transform (DCT) to obtain a visually meaningful cipher image.
About: This article is published in Information Sciences.The article was published on 2021-10-01. It has received 106 citations till now. The article focuses on the topics: Encryption & Discrete cosine transform.
Citations
More filters
Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper presented a new asymmetric image encryption and hiding algorithm based on SHA-3 and compressive sensing, which is able to resist the chosen-plaintext attack (CPA) and the known-plain text attack (KPA), and the experimental results show that the algorithm has strong imperceptibility and key sensitivity.
Abstract: This paper presents a new asymmetric image encryption and hiding algorithm based on SHA-3 and compressive sensing. First, to resist the chosen-plaintext attack (CPA) and the known-plaintext attack (KPA), SHA-3 is employed to calculate the hash values of the plain image, and they are transformed into the initial values of the chaotic map. Second, the plain image is divided into blocks which are processed by sparse transform, scrambling, compressive measurement, and merged. Then they are quantized and scrambled again to get an encrypted image. Third, the encrypted image is filled with zeros to the same size as the plain image. Then three numbers from the hundreds digit, tens digit, and single digit of each pixel are extracted respectively. Finally, the carrier image is transformed by integer wavelet transform (IWT) to get four coefficients, and then the above three numbers are embedded into low-frequency coefficients respectively. By inverse IWT, the carrier image containing secrets (CICS) can be obtained. The experimental results show that the algorithm has strong imperceptibility and key sensitivity. Especially, when the embedding coefficient is set to 1.0, the NC value between the carrier image (CI) and the CICS can reach 0.9999, and the PSNR value can reach about 43 dB.

29 citations

Journal ArticleDOI
01 Jan 2022
TL;DR: Wang et al. as discussed by the authors designed a new general form of n-dimensional conservative chaos according to the generalized Hamiltonian system, which has excellent chaotic characteristics such as wide ergodicity, no attractors, no chaotic degradation, and it can resist reconstruction and other attacks.
Abstract: In view of the problem that dissipative chaos has attractors and is easy to be attacked by reconstruction, which leads to the security defects of encryption algorithm based on dissipative chaos, we design a new general form of n-dimensional conservative chaos according to the generalized Hamiltonian system. Taking four-dimensional (4D) as an example, numerical verification and performance analysis show that the conservative chaos has excellent chaotic characteristics such as wide ergodicity, no attractors, no chaotic degradation, and it can resist reconstruction and other attacks. Based on this 4D conservative chaos, we propose a new image encryption algorithm, which includes the plaintext related dynamic scrambling method and the dynamic diffusion mechanism of quadrilateral rule (MQR). Moreover, the initial values of the system are controlled by the external key stream and the internal key stream, so that the generation of ciphertext information are closely related with that of plaintext information, part of the ciphertext information, pseudo-random sequence and the key stream, which can increase the ability of the algorithm to resist plaintext and other attacks. Experimental simulation and performance analysis show that the encryption algorithm has better security and real time communication.

26 citations

Journal ArticleDOI
01 Feb 2022-Entropy
TL;DR: A hybrid domain image encryption algorithm is developed by integrating with improved Henon map, integer wavelet transform (IWT), bit-plane decomposition, and deoxyribonucleic acid (DNA) sequence operations, which has a high level of security and strong robustness to various cryptanalytic attacks.
Abstract: A hybrid domain image encryption algorithm is developed by integrating with improved Henon map, integer wavelet transform (IWT), bit-plane decomposition, and deoxyribonucleic acid (DNA) sequence operations. First, we improve the classical two-dimensional Henon map. The improved Henon map is called 2D-ICHM, and its chaotic performance is analyzed. Compared with some existing chaotic maps, 2D-ICHM has larger parameter space, continuous chaotic range, and more complex dynamic behavior. Second, an image encryption structure based on diffusion–scrambling–diffusion and spatial domain–frequency domain–spatial domain is proposed, which we call the double sandwich structure. In the encryption process, the diffusion and scrambling operations are performed in the spatial and frequency domains, respectively. In addition, initial values and system parameters of the 2D-ICHM are obtained by the secure hash algorithm-512 (SHA-512) hash value of the plain image and the given parameters. Consequently, the proposed algorithm is highly sensitive to plain images. Finally, simulation experiments and security analysis show that the proposed algorithm has a high level of security and strong robustness to various cryptanalytic attacks.

19 citations

Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper proposed a thumbnail preserving encryption (TPE) based on genetic algorithm, where pixels in the sub-blocks of the plain image are scrambled and diffused at the bit-level through crossover and mutation operators of the genetic algorithm.

19 citations

References
More filters
Journal ArticleDOI
TL;DR: A binary tree structure is exploited to solve the problem of communicating pairs of peak points and distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low.
Abstract: In this letter, we present a reversible data hiding scheme based on histogram modification. We exploit a binary tree structure to solve the problem of communicating pairs of peak points. Distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low. We also adopt a histogram shifting technique to prevent overflow and underflow. Performance comparisons with other existing schemes are provided to demonstrate the superiority of the proposed scheme.

550 citations

Journal ArticleDOI
TL;DR: This paper proposes a parallel diffusion method that ensures the parallelism of diffusion to the utmost extent and achieves a qualitative improvement in efficiency over traditional streaming diffusion methods.

301 citations

Journal ArticleDOI
TL;DR: A Boolean network encryption algorithm for a synchronous update process is proposed, and a matrix semi-tensor product technique to generate an encrypted image in a second round of diffusion shows good security characteristics.

295 citations

Journal ArticleDOI
TL;DR: A new kind of chaotic cryptosystem which overcomes these difficulties to some extent is proposed, based on a discretization of the skew tent map and some of the desirable properties regarding ciphertext randomness may be closely related to the cryptological security.
Abstract: Many kinds of chaotic cryptosystems have been proposed. Chaotic systems dissipate information due to orbital instability with positive Lyapunov exponents and ergodicity. If these properties are appropriately utilized, chaotic cryptosystems are supposed to realize high security. However, most of the existing secure communication techniques using chaos do not have enough security. For example, secure communication protocols based on chaos synchronization require robustness which gives useful information to attackers. The cryptosystems based on direct applications of chaotic maps have been weak against linear and differential cryptoanalysis. In this paper, a new kind of chaotic cryptosystem which overcomes these difficulties to some extent is proposed. The cryptosystem is based on a discretization of the skew tent map. We also show some of the desirable properties of the proposed cryptosystem using dynamical characteristics. These properties regarding ciphertext randomness may be closely related to the cryptological security. Our new cryptosystem uses one step to connect the theory of commonly used cryptosystems and dynamical system theory.

267 citations

Journal ArticleDOI
TL;DR: This paper constructs a more efficient and secure chaotic image encryption algorithm than other approaches and presents a new method of global pixel diffusion with two chaotic sequences, which offers good security and high encryption efficiency.

250 citations