Image Cryptosystem Research Articles

Fast and Lightweight Image Cryptosystem for IoMT Applications

This paper presents a fast and lightweight image encryption technique founded on a new concept of progressive and selective diffusion. We make use of modified chaotic systems like the sine-logistic system, sine-tangent system, and tent-logistic system to generate key blocks for diffusion. The encryption procedure comprises three stages: column diffusion, permutation, and row diffusion, which collectively contribute to the overall encryption mechanism. In the first stage, progressive and selective column substitution of the input image is conducted employing key-blocks D1 and D2, in a manner that each substituted column data is a function of previously diffused data. In the second stage, the column-substituted image goes through an adaptive permutation operation realized using an improved sin-logistic system. The last stage incorporates two distinct mappings based on key arrays and key blocks to ensure selective and progressive inter-row substitution/diffusion. The experimental results suggest that the proposed image system exhibits rapid performance as it reports an average encryption time of 0.03 seconds for an image of the size 256×256. Besides, the use of 1-D chaotic maps together with simple yet effective confusion and diffusion processes make it lightweight. Furthermore, it provides better security performance shown by various parameters like Information Entropy Analysis (IE), Correlation Coefficient analysis (CC), Histogram analysis, Differential Attacks Analysis (NPCR and UACI), key sensitivity assessment, and fidelity analysis. The suggested system has the capability to meet the cryptographic objectives as it reports average values of IE = 7.9974, CC =0.0035, NPCR =99.61%, UACI = 33.48%, and an enormously large key space compared to the state-of-art. The proposed technique offers enhanced data security, preserving patient privacy and preventing unauthorized access, while ensuring efficient encryption performance to assure the security and immediate transmission and storage of medical images. The better security performance together with computational efficiency and lightweight nature makes it an ideal candidate to be used in IoMT systems.

A Hybrid Cryptosystem Incorporating a New Algorithm for Improved Entropy.

Today, safeguarding sensitive content through encryption is crucial. This work presents a hybrid cryptosystem for images that employs both asymmetric and symmetric encryption. The asymmetric component involves applying the Diffie-Hellman protocol and the ElGamal cryptosystem to securely transmit two constants. These constants are necessary for the symmetrical aspect to generate dynamic permutations, substitution boxes, and round keys. Following an encryption process with fourteen rounds, the encrypted images are processed by an algorithm proposed to enhance entropy, a critical metric for assessing encryption quality. It increases the frequencies of the basic colors to achieve a histogram closely resembling a uniform distribution, but it increases the image size by approximately 8%. This improves the entropy values achieved by the hybrid cryptosystem, bringing them remarkably close to the ideal value of 8.0. In specific instances, the entropy values were elevated from 7.99926 to 8.0. The proposed method exhibits resilience against various attacks, including differential, linear, brute force, and algebraic attacks, as evaluated through the entropy, correlation, goodness of fit, Discrete Fourier Transform (DFT), Number of Pixels Change Rate (NPCR), Unified Average Changing Intensity (UACI), Avalanche Criteria (AC), contrast, energy, and homogeneity. Further, encrypted images are subjected to noise attacks ranging from 20% to 50% noise, including additive, multiplicative, occlusion noise, as well as the newly introduced χ2 noise. The noise damage is quantified using the proposed Similarity Parameter (SP), and a 3 × 3 median filter is employed to enhance the visual quality.

Image encryption algorithm based on improved iterative chaotic map with infinite collapses and Gray code

The quick advancement of multimedia technology has led to the widespread utilization of digital images across various industries. Meanwhile, image security has become an urgent issue in need of resolution. To guarantee image security as well fulfill the requirements of real-time image cryptosystems, a novel image encryption algorithm is proposed based on the designed improved iterative chaotic map with infinite collapses (ICMIC), Gray code and semi-pixel level permutation and diffusion. Firstly, two chaotic sequences are produced using the improved ICMIC and then they are used to perform scrambling and diffusion operations. Secondly, the plain image is encoded using Gray code and then we convert each Gray code into two semi-pixels. Thirdly, the designed semi-pixel level permutation is used to scramble the semi-pixel vector. Finally, the scrambled semi-pixel vector is diffused using the designed dynamic semi-pixel level diffusion. The performance analyses illustrate that the proposed algorithm possesses robust security and high efficiency, making it ideally suited for application in real-time image cryptosystems.

Image encryption using enhanced DCT transform for frequency domain applications

improving system performance and reliability. Key leaks and inadequate key strength are common issues with numerical global key models and public block cipher algorithms that use pseudo-random numbers. Additionally, because of the spatial correlation between neighboring pixel values, no current crypto scheme is appropriate for picture encryption. An intellectual domain-based image cryptosystem with hierarchical modification structures is proposed to overcome all these obstacles. The suggested framework also aims to maximize confusion metrics and improve security efficiency. In this paper modified DCT transform domain based frequency domain image encryption is proposed along with optimized pixel grouping based cipher key formulation with reduced complexity overhead. The proposed image encryption model can achieve 100 percentage transformations irrespective to the image non-linear characteristics and associated spatial dimensions. To validate the performance metrics of proposed image encryption different biomedical images collected and the superiority of proposed system is verified using quantitative and qualitative analyzes. The proposed implementation helps in offering privacy in crypto system based network security. It also validated that this hybrid combination also extend the applicability of crypto system for EMR applications.

An Efficient Image Encryption Method Based on Enhanced Josephus Problem and a Non-Invertible Economic Map

As an increasing number of digital images are created and transmitted over the internet, there is growing concern over their unauthorized use, which has a big impact on both security and privacy concerns. In this research, we provide a fast and secure image encryption scheme by using an enhanced Josephus problem and two-dimensional non-invertible economic chaotic map (2D-ECM) to safely and covertly protect digital image information throughout public channel transmission. First, the initial values of the 2D-ECM map are generated based on Secure Hash Algorithm (SHA-256) and the input secret key. Then, the Josephus problem is enhanced by substituting the extract operation with location exchange and dynamic start location and step size is employed to scramble the image pixels. In order to integrate the confusion process and diffusion process, the enhanced Josephus problem is utilized indirectly to choose two random columns from the scrambled image and random image to XOR them with the current column. The evaluation results prove that the proposed image cryptosystem is more efficient compared to existing cryptosystems.

On the security of image cryptosystems using DRPE based on scrambling and diffusion

On the security of image cryptosystems using DRPE based on scrambling and diffusion

Novel chaotic image cryptosystem using dynamic DNA coding

This study aims to solve the problem of small key space in image cryptosystems based on logistic mapping. First, a new one-dimensional (1D) chaotic system, with a wide continuous chaotic interval, a large Lyapunov exponent and obvious chaotic characteristics are presented. Subsequently, a novel image encryption algorithm based on the new 1D chaotic system and dynamic DNA encoding is designed. Compared with other DNA coding methods, the proposed image encryption algorithm encodes chaotic sequences and ensures that the sequence elements at different positions correspond to different DNA coding schemes. This will help to overcome the fixity of DNA coding and make the proposed dynamic DNA coding easy to operate and implement. Finally, the cipher image is obtained by scrambling and bit XOR operation based on the chaotic sequences. The fixed DNA coding method is compared with other chaotic image encryption schemes, and the experimental results indicate that the image encryption algorithm has higher security and can resist common attacks.

An image crypt model based on enhanced two-dimensional sine-cosine chaotic map

Sensitive images are being transmitted over insecure media as network and information technology evolve at a rapid pace. As a result, people are becoming more concerned about information security, specifically digital image protection. For securing digital images, numerous image encryption algorithms have been proposed. From that, a chaotic map has been proved a perfect image protection tool as it contains efficient random behaviour. This work proposes a novel two-dimensional sine-cosine map for developing an image cryptosystem. In the developed framework, at first, two random chaotic series are generated by the developed sine-cosine map, then the given image is divided into two blocks, and each block is confused by utilizing different chaotic key series. In the diffusion process, the chaotic series is first changed into integer form, which is applicable for executing some arithmetic operation between chaotic values and image pixels. In the diffusion phase, each confused image block pixel is converted into binary form, and a bit shifting operation is executed depending on the integer form of chaotic series. In the final process, a bit-xor operation is performed between the partial diffused image and chaotic series to obtain the final encrypted image. The proposed model's security strength will be evaluated using statistical and differential attack analysis.

A novel multi-scroll hyperchaotic system applicable for visually secure image cryptosystem using block compressive sensing

A novel multi-scroll hyperchaotic system applicable for visually secure image cryptosystem using block compressive sensing

A comparative analysis of phase retrieval algorithms in asymmetric double image cryptosystem in gyrator domain

A comparative analysis of phase retrieval algorithms in asymmetric double image cryptosystem in gyrator domain

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.

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.

Synchronization of Boolean networks with chaos‐driving and its application in image cryptosystem

AbstractThis paper proposes a Boolean network model with high dimensional chaos driving and investigates the synchronization of the chaos‐driven Boolean network with a semi‐tensor product. In order to protect the privacy and ensure the security of image transmission, the synchronization results are utilized in the image cryptosystem to achieve compression and encryption. First, the driving chaos system is coupled with multiple local systems and synchronized with the transmitted encrypted signals. Second, the Boolean network is driven and synchronized with derived chaos signals. Finally, images are encrypted and compressed with chaos‐driven Boolean network signals in the transmitter, and then decrypted and recovered with synchronized chaos and Boolean network signals in the recipient. Because of the complexities of high dimensional chaos and Boolean network, the proposed cryptosystem has good security in the secure communication and image process.

Image encryption algorithm based on 2D hyper-chaotic system and central dogma of molecular biology

Abstract With the widespread use of images, image security has received much attention. Image security can be guaranteed by encrypting the plain image and transmitting the corresponding cipher image. This paper proposes an image encryption algorithm based on the novel two-dimensional (2D) hyper-chaotic system, bidirectional diagonal crossover transformations (BDCTs) and central dogma of molecular biology. Firstly, six chaotic sequences are generated using the proposed hyper-chaotic system, which are used in the permutation and diffusion processes. Secondly, the 5th–8th bit-planes of plain image are permuted using the designed BDCTs. Thirdly, the permuted image is dynamically encoded into a quaternary DNA sequence, and then the quaternary DNA sequence is transcribed into a quaternary RNA sequence. After that, the quaternary RNA sequence is diffused using quaternary RNA operations. Finally, the diffused RNA sequence is translated into a codon sequence, and then the designed codon-level multipoint crossover scheme is used to further improve the diffusion effect. Experiment results and security analyses demonstrate that our algorithm has high security and efficiency. In other words, our algorithm is quite suitable for real-time image cryptosystems.

Dynamic RNA Coding Color Image Cipher Based on Chain Feedback Structure

This paper proposes a dynamic RNA-encoded color image encryption scheme based on a chain feedback structure. Firstly, the color pure image is decomposed into red, green, and blue components, and then a chaotic sequence based on plaintext association is introduced to encrypt the red component. Secondly, the intermediate ciphertext is obtained by diffusion after encryption by bit-level permutation, RNA dynamic encoding, RNA dynamic operation rules, and RNA dynamic decoding. Finally, to enhance the security of the image cryptosystem, the green and blue components of the image are repeatedly encrypted using the chain encryption mechanism associated with the intermediate ciphertext to obtain the color cryptographic image. In this paper, a 2D-SFHM chaotic system is used to provide pseudo-random chaotic sequences, and its initial key is calculated by combining the hash function and external parameters of the image, and the one-time ciphertext encryption strategy causes the proposed encryption to effectively resist cryptographic attacks. Experimental results and security analysis show that our encryption algorithm has excellent encryption effects and security performance against various typical attacks.

Real time region of interest based chaotic image cryptosystem for IoT applications

Real time region of interest based chaotic image cryptosystem for IoT applications

A hybrid medical image cryptosystem based on 4D-hyperchaotic S-boxes and logistic maps

A hybrid medical image cryptosystem based on 4D-hyperchaotic S-boxes and logistic maps

Camouflaged image cryptosystem based on compressive interference against deep learning

In this paper, our previously proposed compressive interference-based image cryptosystem (CIBC) is utilized to develop a camouflaged image cryptosystem, in which a secret image is camouflaged by a meaningful image. During the encryption process, a secret image is encoded into two sparse and complementary phase only masks (POMs) by CIBC under the constraints of two binary amplitude masks(BAMs), in which the BAM can be taken as a private key. Then, a camouflaged image is encoded into another two POMs by CIBC under the constraints of the two POMs generated in the aforementioned step, and the two final POMs are stored and transmitted as ciphertexts. In the decryption process, only authorized users, who can access the ciphertexts, public and private keys simultaneously, can retrieve the decrypted secret image. Otherwise, even if the eavesdropper cracks the ciphertexts and the public keys, only the camouflaged image can be directly obtained, which can confuse the eavesdropper and then protect the secret image. Several simulation experiments were demonstrated to verify the feasibility and security of this cryptosystem.

Fast Novel Efficient S-Boxes with Expanded DNA Codes

IoT is one of the most popular technologies in recent years due to the interconnection of various infrastructures, physical devices, and software. To guarantee the security of Internet of Things (IoT) pervasiveness, lightweight cryptographic solutions are needed and this requires lightweight cryptographic primitives. The choice of S-box in light block ciphers plays an important role in characterizing the security-performance trade-off. The choice of the 4 × 4 S-box for the lightweight constructions results in compact hardware, speeding up the computational capability of the security algorithm unlike the 8 × 8 S-box. This work presents efficient algebraic S-boxes for a fast image cryptosystem based on a strong nonlinear function which is expanded by a biological technique depending on DNA. The robustness of the proposed S-boxes is analysed and tested against various standard attack criteria such as interpolation attacks, avalanche effect, and nonlinearity. The great advantage of introducing S-boxes is that its DSAC is the ideal value which is equal to zero. Also, other tests executed on these S-boxes guaranteed its robustness and excellent security performance. Moreover, the experiments are applied with full description in two different modes; RGB and gray images. The results of all tests proved to have fast and strong effective S-boxes.

Multiple-Layer Image Encryption Utilizing Fractional-Order Chen Hyperchaotic Map and Cryptographically Secure PRNGs

Image encryption is increasingly becoming an important area of research in information security and network communications as digital images are widely used in various applications and are vulnerable to various types of attacks. In this research work, a color image cryptosystem that is based on multiple layers is proposed. For every layer, an encryption key and an S-box are generated and utilized. These are based on a four-dimensional (4D) dynamical Chen system of a fractional-order, the Mersenne Twister, OpenSLL, Rule 30 Cellular Automata and Intel’s MKL. The sequential application of Shannon’s ideas of diffusion and confusion three times guarantees a total distortion of any input plain image, thereby, resulting in a totally encrypted one. Apart from the excellent and comparable performance to other state-of-the-art algorithms, showcasing resistance to visual, statistical, entropy, differential, known plaintext and brute-force attacks, the proposed image cryptosystem provides an exceptionally superior performance in two aspects: a vast key space of 21658 and an average encryption rate of 3.34 Mbps. Furthermore, the proposed image cryptosystem is shown to successfully pass all the tests of the NIST SP 800 suite.