Plaintext Image Research Articles

ESTPE: An efficient and stable thumbnail-preserving encryption scheme

Thumbnail-preserving encryption (TPE) can balance the usability and the privacy of images in the cloud. Most ideal TPE schemes obtain thumbnails by dividing the plaintext image into multiple blocks, and then perform substitution and permutation operations in each block. The size of partitioned blocks affect the usability and the privacy of the encrypted images. The size of the pixel groups in the blocks, i.e., the number of encrypted pixels per time, has experienced the development from 2-pixel to n-pixel in recent years. Existing solutions cannot promote the real implementation and commercial realization because of inefficiency and instability. In this paper, we propose an efficient and stable TPE scheme, which can select intelligently different sizes of pixel groups in each block. Theoretical analysis indicates that the encryption time is influenced by the sum and the number of pixels in a pixel group. The length of the pixel group and the sum of pixel values in a group influence each other. We try to determine the optimal combination of these two factors. Through the analysis of Markov model, the proposed scheme has the nonce-respecting security. The experimental results of comparison show that, for the images with size of 480 × 320, the average encryption time of the proposed scheme is 61.7% less than that of 3-pixel flexible TPE, which is the most effective scheme up to now. And the fluctuation value decreases by 34.8%.

On a Symmetric Image Cryptosystem Based on a Novel One-Dimensional Chaotic System and Banyan Network

In this paper, a Banyan network with high parallelism and nonlinearity is used for the first time in image encryption to ensure high complexity and randomness in a cipher image. To begin, we propose a new 1-D chaotic system (1-DSCM) which improves the chaotic behavior and control parameters’ structure of the sin map. Then, based on 1-DSCM, a Banyan network, and SHA-256 hash function, a novel image encryption algorithm is conducted. Firstly, a parameter is calculated using SHA-256 hash function and then employed to preprocess the plaintext image to guarantee high plaintext sensitivity. Secondly, a row–column permutation operation is performed to gain the scrambled image. Finally, based on the characteristic of DNA encoding, a novel DNA mapping is constructed using an N=4 Banyan network and is used to diffuse the scrambled image. Simulation results show that the 1-DSCM has excellent performance in chaotic behavior and that our encryption algorithm exhibits strong robustness against various attacks and is suitable for use in modern cryptosystems.

Image encryption algorithm based on hyperchaotic system and dynamic DNA encoding

Since the existing DNA encryption algorithms only have fixed DNA coding and decoding rules and a single algorithm that cannot meet more complex and more secure encryption requirements, an image encryption algorithm based on hyperchaotic system and dynamic DNA coding is proposed. The algorithm proposes two new operation methods in the DNA operation rules, namely the equal-additive column transformation and the equal-subtractive column transformation. which combine the SHA-256 function and the external key to generate the initial value of the chaotic system to ensure that key and plaintext of algorithm are correlated. In the encryption process, the plaintext image is firstly converted into a two-dimensional matrix for rotation and scrambling. Then the chaotic sequence generated by the hyperchaotic Chen system is used to perform DNA dynamic encoding, decoding and operation on the scrambled matrix and block matrix generated by logistic chaotic sequence. Finally, the encrypted matrix is scrambled in one dimension. Simulation results show that the improved encryption algorithm has a larger key space, breaks the strong correlation between image pixel layers, and can effectively resist multiple attacks.

Research and application of Big data encryption technology based on quantum lightweight image encryption

Given the limitations of current classic image encryption algorithms and the unconditional security characteristics of quantum key distribution protocols, the author proposes an image encryption method based on quantum key distribution and pixel scrambling. The author first analyzed the security issues of quantum image encryption algorithms based on image scrambling methods, namely that image scrambling methods have periodicity, which can ensure that the image can be restored after scrambling. If an image cannot be guaranteed to return to its original state after performing scrambling operations, legitimate users cannot obtain the secret information in the original image, and image scrambling loses its original meaning; However, the periodicity of image scrambling methods not only ensures that legitimate users can decrypt images, but also provides convenience for attackers to steal original image information. Secondly, it is pointed out that when evaluating and analyzing quantum image encryption algorithms, the evaluation indicators should include two parts: One is performance analysis, which is the analysis of the network complexity of quantum circuits. In quantum computing, the network complexity of quantum circuits is usually represented by the number of quantum basic logic gates. The second is security analysis, which mainly includes key analysis (including key space size and key sensitivity analysis), statistical analysis (including pixel correlation, histogram analysis, information fusion, and scatter plot distribution density analysis). Finally, experimental simulations have shown that the NPCR values of the plaintext and ciphertext images of the three images tend to 100%. The encrypted image histogram is evenly distributed, with very weak pixel correlation and high pixel change rate and information entropy.

An Applied Image Cryptosystem on Moore’s Automaton Operating on δ ( q k )/𝔽 2

The volume of multimedia-based image data or video frames in Web 3.0 is constantly increasing, owing to the advancement of real-time data transmission. However, security vulnerabilities frequently impair the performance of real-time applications. Many researchers have recently proposed image encryption schemes based on a high-dimensional chaotic system due to properties such as ergodicity and initial state sensitivity. Nonetheless, most schemes have suffered from excessive computational complexity, low security, and the generation of cryptographically secure random numbers. To overcome these challenges, an efficient and highly secure cryptosystem is necessary for safe multimedia transmission in Web 3.0. This article proposes a novel work on the image cryptosystem based on the Escalation function with a one-time key-oriented Moore’s Automaton over a finite field 𝔽 2 . The Escalation function is a nonlinear scrambling technique for plaintext images that goes through the confusion phase and plays an essential role in row-column permutation. To make the algorithm more secure and robust in the diffusion phase, the proposed Moore’s Automaton produced ciphertext images through a highly random key stream generated by the combination of a logistic map and cyclic group. Specifically, the proposed Moore’s Automaton operates on δ ( q k )/𝔽 2 to render random binary bits into unpredictable sequences to construct ciphertext images. Our new finding quickens the speed and provides adequate key space, and pixel distributions are more uniform, have high entropy value, and are secure against differential and statistical attacks.

A 4D discrete Hopfield neural network-based image encryption scheme with multiple diffusion modes

A novel 4D chaotic map is proposed in this paper using the model of a self-feedback Discrete Hopfield Neural Network (DHNN) with nonlinear synaptic ICMIC (4D-IDHNN). Based on an analysis of chaos characteristics, including attractors, Lyapunov exponents, Bifurcation, Sample Entropy and CO algorithms, the 4D-IDHNN system demonstrates reasonable stochasticity and ergodicity, alongside a broad spectrum of hyperchaotic parameters. Based on the 4D-IDHNN system, we design a new Pixel-dependent bit-plane Chaotic random Diffusion (PbCrD) algorithm with high diffusion capability and security. To begin, the 4D-IDHNN system generates pseudo-random sequences to confuse the plaintext image pixel positions with Chaotic Magic Random Scramble (CMRS). Subsequently, the PbCrD algorithm can be employed to diffuse pixel values. With the initial value of 4D-IDHNN generated using the SHA-256 hash of plaintext image, the ability to resist plaintext attacks can be enhanced. The algorithm includes 24 diffusion modes, which is three times greater than the number of DNA rules, thereby enhancing the complexity of decryption. The proposed encryption algorithm has good effectiveness, robustness, and resistance to differential attacks based on simulations and security analyses.

Visualized Multiple Image Selection Encryption Based on Log Chaos System and Multilayer Cellular Automata Saliency Detection

For the security of multiple image regions of interest, this paper designs a multi-image visual encryption algorithm based on region of interest (ROI). Firstly, a new one-dimensional chaotic system (1-DLCP) is proposed. The performance analysis shows that the system has better dynamic behavior. Then, the salient parts of multiple images are extracted using multilayer cellular automata saliency detection. The measured matrix generated by the proposed chaotic system compresses the extracted plaintext images respectively. The compressed image and the extracted salient parts are recombined into one image, and a scrambling-diffusion synchronization operation is performed on the recombined image to obtain a secret image. The final embedding stage uses integer wavelet transform (IWT) to embed the secret image into a color carrier image. It is worth mentioning that this design scheme not only reconstructs the significant part without damage, but also reduces the storage space.

Implementation of Quantum Image Encryption via Reversible Quantum Logic Gates Computing

With the development of quantum communication technology, Shor’s algorithm is expected to crack RSA encryption. Quantum communication will change the method of classical encryption in the future. We propose a quantum image encryption method via reversible quantum logic gates computing as quantum computing is reversible. An entangled pair of qubits are used for data transmission. The plaintext image is encrypted into an encrypted image via the quantum gate by using superdense coding to encrypt and transmit the operating quantum gate. The encrypted image is decoded by reversible computing, which is expected to provide a way for quantum image encryption.

Securing Medical Information Transmission Between IoT Devices: An Innovative Hybrid Encryption Scheme Based on Quantum Walk, DNA Encoding, and Chaos

The healthcare industry has undergone a transformation due to the widespread use of advanced communication technologies and wireless sensor networks such as the Internet of Medical Things (IoMT), Health Information Exchange Technology (HIET), Internet of Healthcare Things (IoHT) and Health IoT (HIoT). These technologies have led to an increase in the transmission of medical data, particularly medical imaging data, over various wireless communication channels. However, transmitting high-quality color medical images over insecure internet channels like the Internet and communication networks like 5G presents significant security risks that could threaten patients’ data privacy. Furthermore, this process can also burden the limited bandwidth of the communication channel, leading to delayed data transmission. To address security concerns in healthcare data, researchers have focused a lot of attention on medical image encryption as a means of protecting patient data. This paper presents a color image encryption scheme that integrates multiple encryption techniques, including alternate quantum random walks, controlled Rubik’s Cube transformations, and the integration of the Elliptic Curve Cryptosystem with Hill Cipher (ECCHC). The proposed scheme divides various plaintext images by creating a regular cube by layering planes of a fixed size. Each plane is rotated in an anticlockwise direction, followed by row, column and face swapping, and then DNA encoding is performed. The image cube encoded with DNA is combined with the chaotic cube through DNA addition, and a couple of random DNA sequences are chosen for DNA mutation. After undergoing DNA mutation, the encoded cube is then decoded using DNA. The proposed method has the theoretical capability of encrypting 2D images of unlimited size and number by utilizing an infinitely large cube. The proposed image encryption scheme has been rigorously tested through various experimental simulations and cyberattack analysis, which shows the efficiency and reliability of the proposed encryption scheme.

Optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system and compressed sensing

Some existing image encryption schemes use simple low-dimensional chaotic systems, which makes the algorithms insecure and vulnerable to brute force attacks and cracking. Some algorithms have issues such as weak correlation with plaintext images, poor image reconstruction quality, and low efficiency in transmission and storage. To solve these issues, this paper proposes an optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system (4D MHS) and compressed sensing (CS). Firstly, this paper proposes a new 4D MHS, which has larger key space, richer dynamic behavior, and more complex hyperchaotic characteristics. The introduction of CS can reduce the image size and the transmission burden of hardware devices. The introduction of double random phase encoding (DRPE) enables this algorithm has the ability of parallel data processing and multi-dimensional coding space, and the hyperchaotic characteristics of 4D MHS make up for the nonlinear deficiency of DRPE. Secondly, a construction method of the deterministic chaotic measurement matrix (DCMM) is proposed. Using DCMM can not only save a lot of transmission bandwidth and storage space, but also ensure good quality of reconstructed images. Thirdly, the confusion method and diffusion method proposed are related to plaintext images, which require both four hyperchaotic sequences of 4D MHS and row and column keys based on plaintext images. The generation process of hyperchaotic sequences is closely related to the hash value of plaintext images. Therefore, this algorithm has high sensitivity to plaintext images. The experimental testing and comparative analysis results show that proposed algorithm has good security and effectiveness.

An Image Encryption Algorithm Based on Improved Hilbert Curve Scrambling and Dynamic DNA Coding.

As an effective method for image security protection, image encryption is widely used in data hiding and content protection. This paper proposes an image encryption algorithm based on an improved Hilbert curve with DNA coding. Firstly, the discrete wavelet transform (DWT) decomposes the plaintext image by three-level DWT to obtain the high-frequency and low-frequency components. Secondly, different modes of the Hilbert curve are selected to scramble the high-frequency and low-frequency components. Then, the high-frequency and low-frequency components are reconstructed separately using the inverse discrete wavelet transform (IDWT). Then, the bit matrix of the image pixels is scrambled, changing the pixel value while changing the pixel position and weakening the strong correlation between adjacent pixels to a more significant correlation. Finally, combining dynamic DNA coding and ciphertext feedback to diffuse the pixel values improves the encryption effect. The encryption algorithm performs the scrambling and diffusion in alternating transformations of space, frequency, and spatial domains, breaking the limitations of conventional scrambling. The experimental simulation results and security analysis show that the encryption algorithm can effectively resist statistical attacks and differential attacks with good security and robustness.

Visual image encryption algorithm based on compressed sensing and 2D cosine -type logistic map

A new two-dimensional cosine-type Logistic map (2D-CTLM) is proposed in this paper. Performance analysis shows that 2D-CTLM has good ergodicity, complex behavior, and a wide range of chaotic regions. To study its application, an adaptive embedded high visual security image encryption scheme is proposed by combining the system with two-dimensional compression sensing to address the shortcomings of fixed embedding positions and low transmission efficiency in existing schemes. The embedding position is fixed when the ciphertext image is embedded into the carrier image. When embedded in an inappropriate location, it will affect the decryption quality and the imperceptibility of the steganographic image. Firstly, the initial value of 2D-CTLM system is generated by using the information entropy of plaintext image and counter to generate random measurement matrix, which is used to compress and encrypt plaintext image from two directions at the same time. Secondly, the compressed cipher image is scrambled by the initial matrix generated by the GOL (game of life) rules in two-dimensional cellular automata to obtain the ciphertext image. Finally, the most suitable embedding position in the carrier image is found by combining information entropy and edge entropy. Then the unquantized ciphertext image is embedded into it by ST (slant transform) embedding method to obtain a high visual security image. To improve the transmission efficiency, the color carrier image can be selected to transmit three gray plaintext images at the same time, maintain high-quality reconstruction effect. SHA-512 and the information entropy of plaintext image are used to generate the initial value of encryption and measurement matrix, enhance the correlation between the algorithm and plaintext image, and effectively resist known plaintext and selective plaintext attacks. Simulation results and performance analysis show that compared with the existing encryption schemes, the encryption scheme has excellent visual effect, good decryption quality and good robustness.

Optical image conversion and encryption based on structured light illumination and a diffractive neural network.

In this paper, an optical image encryption method is proposed based on structured light illumination and a diffractive neural network (DNN), which can realize conversion between different images. With the use of the structured phase mask (SPM) in the iterative phase retrieval algorithm, a plaintext image is encoded into a DNN composed of multiple phase-only masks (POMs) and ciphertext. It is worth noting that ciphertext is a visible image such that the conversion of one image to another is achieved, leading to high concealment of the proposed optical image encryption method. In addition, the wavelength of the illuminating light, all Fresnel diffraction distances, the optical parameters of the adopted SPM such as focal length and topological charge number, as well as all POMs in the DNN are all considered as security keys in the decryption process, contributing to a large key space and high level of security. Numerical simulations are performed to demonstrate the feasibility of the proposed method, and simulation results show that it exhibits high feasibility and safety as well as strong robustness.

A visual DNA compilation of Rössler system and its application in color image encryption

This paper proposes the use of visual DNA compilation for the Rössler chaotic system in the context of semi-synthetic biology, which has promising prospects for the development of next-generation computers. The proposed method utilizes DNA toehold mediated strand displacement circuit and fluorescent labeling to construct a DNA circuit as a pseudo-random number generator with high information entropy. To overcome the degeneration of the key space due to the finite precision of concentration detection, the key space is expanded based on the keys of dk. Additionally, concentrations of DNA strand detected in valid time are transformed into diverse multiple blocks to construct chaotic sequences. Experimental results demonstrate that the proposed encryption approach is highly secure and has a strong ability to resist common attacks. Specifically, the proposed image encryption algorithm provides positive security and is resistant to diverse attacks, thus ensuring the information security of the plaintext image.

Exploiting Dynamic Vector-Level Operations and a 2D-Enhanced Logistic Modular Map for Efficient Chaotic Image Encryption.

Over the past few years, chaotic image encryption has gained extensive attention. Nevertheless, the current studies on chaotic image encryption still possess certain constraints. To break these constraints, we initially created a two-dimensional enhanced logistic modular map (2D-ELMM) and subsequently devised a chaotic image encryption scheme based on vector-level operations and 2D-ELMM (CIES-DVEM). In contrast to some recent schemes, CIES-DVEM features remarkable advantages in several aspects. Firstly, 2D-ELMM is not only simpler in structure, but its chaotic performance is also significantly better than that of some newly reported chaotic maps. Secondly, the key stream generation process of CIES-DVEM is more practical, and there is no need to replace the secret key or recreate the chaotic sequence when handling different images. Thirdly, the encryption process of CIES-DVEM is dynamic and closely related to plaintext images, enabling it to withstand various attacks more effectively. Finally, CIES-DVEM incorporates lots of vector-level operations, resulting in a highly efficient encryption process. Numerous experiments and analyses indicate that CIES-DVEM not only boasts highly significant advantages in terms of encryption efficiency, but it also surpasses many recent encryption schemes in practicality and security.

REVERSIBLE WATERMARKING ALGORITHM WITH CHAOS AND ZUC ENCRYPTION BASED ON DEEP LEARNING IN HEALTHCARE

In view of the shortcomings of the existing reversible watermarking algorithms for encrypted images, such as low embedding rate and incomplete separation, and at the same time ensuring the embedding rate and the quality of the watermarked image, this paper proposes a reversible watermarking algorithm for encrypted images with high embedding rate and separable effect. This paper proposes a reversible watermarking algorithm for encrypted images with high embedding rate and separable effect. First, the plaintext image is encrypted by using the encryption series generated by chaotic system and Zu Chongzhi’s encryption algorithm; Second, analyze the PSNR value of the image under different interpolation conditions, generate the corresponding expected interpolation, and embed the watermark information into the image based on the expected interpolation; Finally, the original image can be recovered by using the encryption key, and the watermark information can be obtained by using the embedded key. The security and embedding ability of the algorithm are analyzed through simulation experiments. The results show that the introduction of ZUC stream cipher can expand the key space of the algorithm, have high security and achieve the separable effect. The embedding of watermark information has little impact on the ciphertext image, and the embedding rate is also higher than the contrast algorithm under the condition of ensuring the visual effect of the image.

A Novel Chaotic Image Encryption Algorithm Based on Propositional Logic Coding

This paper proposes a new chaotic system 2D-HLM, which is a combination of Henon map and logistic map. SHA-256 algorithm based on the plaintext image produces the initial value, which enhances the correlation with the plaintext. Therefore, the algorithm avoids the disadvantages of being easily cracked by selected plaintext attacks. The chaotic sequence generated by 2D-HLM is adopted to scramble an image, and the bit plane is extracted and reorganized on the scrambled image. Based on the relationship between two mathematical propositions of the logistic map operations, a novel propositional logic coding algorithm is proposed. The simulation results show that the algorithm has large key space and high key sensitivity, and can resist common attacks such as differential attack.

Biometric information security based on double chaotic rotating diffusion

Biometric technology is increasingly being used in various areas, including government law enforcement, exit and entry management, visitor access control, user identification, and daily attendance management for companies. This technology simplifies the procedure of user identity verification and reduces the time required for verification. However, the security of biological data stored in the system can be overlooked. To address this, we propose a secure biometric feature matching framework that encrypts all information stored in the biometric system. The system decrypts and extracts feature values only when recognition and matching are required, enabling secure matching judgment. This framework protects private data in the biometric system from illegal theft, tampering, and destruction, and promotes research and practical application of biometric security technology. To fully ensure system data security, we propose an adaptive rotation diffusion image encryption algorithm based on double chaos. The algorithm uses double chaos to control image scrambling and leverages the random characteristics of chaos. The algorithm adopts six different rotation diffusion methods, and different plaintext images lead to completely different diffusion methods, making the algorithm adaptive and effective against selected plaintext attacks. Experimental simulations and performance analysis confirm the feasibility and superiority of the proposed algorithm.

A Multiple-Medical-Image Encryption Method Based on SHA-256 and DNA Encoding.

Ensuring the privacy and secrecy of digital medical images has become a pressing issue as a result of the quick development of smart medical technology and the exponential growth in the quantity of medical images transmitted and stored in networks. The lightweight multiple-image encryption approach for medical images that is suggested in this research can encrypt/decrypt any number of medical photos of varied sizes with just one encryption operation and has a computational cost that is similar to encrypting a single image. The plaintext images with different sizes are filled at the right and bottom of the image to ensure that the size of all plaintext images is uniform; then, all the filled images are stacked to obtain a superimposed image. The initial key, which is generated using the SHA-256 technique, is then used as the starting value of the linear congruence algorithm to create the encryption key sequence. The cipher picture is then created by encrypting the superimposed image with the encryption key and DNA encoding. The algorithm can be made even more secure by implementing a decryption mechanism that decrypts the image independently in order to reduce the possibility of information leaking during the decryption process. The outcomes of the simulation experiment demonstrate the algorithm's strong security and resistance to interference such as noise pollution and lost image content.

Region based medical image encryption using advanced zigzag transform and 2D logistic sine map (2DLSM)

A large number of medical images are generated for diagnostic purposes, disease monitoring, research and education, quality control in health services, and so on. The secure transmission and storage of them demand a significant effort. Most of the available encryption schemes are designed for non-medical images, whereas medical images need a higher level of security and robust authentication. Additionally, in certain cases, only a specific part of the image, which may be separated into the region of interest and the region of background, medical images can be divided into these two regions. A region-based medical image encryption using a 2D logistic sine map (2DLSM) and an advanced zig zag transform is used to secure medical images. First, the Region of Interest (ROI) is extracted from the original medical image using basic morphological techniques, including edge detection, dilation, and erosion. Secondly, the ROI is encrypted using a complex zigzag transform and a 2D logistic sine map (2DLSM). Advanced zigzag transform that crosses in both directions while beginning at random points to jumble the image. This new zigzag transform method is more complex than existing zigzag transform techniques because the number of sequence types is equal to the number of pixels in the plaintext image. The confused image is diffused using a random sequence created using the 2D logistic sine map approach after numerous iterations of an advanced zigzag transformation. In order to save time and computational resources, the background region pixels are eliminated during encryption. Experiments and security analyses show that the suggested approach is strong in defending against diverse assaults and can effectively secure ROI of different types and sizes of medical photos.