Proposed Encryption Technique Research Articles

Hide Digital Images in Encrypted Image Files After Two Stages

This paper introduces a novel encryption technique for concealing digital images within encrypted files through a two-stage process. The methodology incorporates sparse coding and compressive sensing, leveraging a learned dictionary to recover the sparse coding of plain images. Comprising compressive sampling and random projection with a Gaussian measurement matrix, the approach achieves joint compression and encryption. Pseudorandom encryption and chaos-based block scrambling are subsequently applied to produce the final encrypted image. Experimental results using 256 × 256 test photographs from the USC-SIPI dataset demonstrate the superiority of the proposed method in terms of both Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index (SSIM). The study also conducts key sensitivity analysis, revealing the method's susceptibility to changes in the secret key, and statistical attack analysis, demonstrating its robustness against attacks exploiting statistical information. In conclusion, the proposed encryption technique not only ensures cryptographic strength but also excels in image reconstruction quality, making it a promising solution for secure image transmission and storage

FSR-SPD: an efficient chaotic multi-image encryption system based on flip-shift-rotate synchronous-permutation-diffusion operation

Images are a crucial component in contemporary data transmission. Numerous images are transmitted daily through the open-source network. This paper presents a multi-image encryption scheme that utilises flip-shift-rotate synchronous-permutation-diffusion (FSR-SPD) processes to ensure the security of multiple images in a single encryption operation. The proposed encryption technique distinguishes itself from current multi-image encryption methods by utilising SPD operation and rapid FSR-based pixel-shuffling and diffusion operation. The SPD is a cryptographic technique that involves the simultaneous application of permutation and diffusion methods. The FSR-based process involves the manipulation of pixels through three different operations, namely flipping, shifting, and rotating. In the process of encryption, the image components of red, green, and blue colours are merged into a single composite image. The large image is partitioned into non-overlapping blocks of uniform size. The SPD technique is employed to tackle each specific block. The encryption method is efficient and expeditious as it exhibits high performance with both FSR and SPD procedures. The method employs a single, fixed-type, one-dimensional, piecewise linear chaotic map (PWLCM) for both the permutation and diffusion phases, resulting in high efficiency in both software and hardware. The proposed method is assessed using key space, histogram variance, neighbouring pixel correlation, information entropy, and computational complexity. The proposed method has a much bigger key space than the comparative method. Compared to comparison approaches, the suggested solution reduces encrypted picture histogram variance by 6.22% and neighbouring pixel correlations by 77.78%. Compared to the comparison technique, the proposed scheme has a slightly higher information entropy of 0.0025%. Other multiple-color image encryption methods are more computationally intensive than the suggested method. Computer simulations, security analysis, and comparison analysis evaluated the proposed methodology. The results show it outperforms multiple images encrypting methods.

Color image encryption by a non-chain Galois ring extension

The S-box is a vital component for producing nonlinearity in a block cipher. Seldom this component is constructed through finite fields; however, sometimes Galois rings are used for its construction. In this work, we utilize the extended Galois ring to construct a Substitution box (S-box) over the ring The designed S-box is generated by multiple elements and thus exhibits a high level of confusion compared to typical S-boxes. An encrypted color image is compared to existing encrypted S-box images to investigate their effects. First, we separate the distinct channels from a digital image and create 256-order matrices with 16-bit entries for each channel. We then apply the designed image encryption algorithm to these matrices. For the permutation step, we use the 1-dimensional logistic map to generate the key. Then, we apply the exclusive-or operation to all three layers of the image using the key. Finally, concatenate all these layers to create the encrypted image. The result is the proposal of a new RGB image encryption technique. The proposed encryption technique can replace several image encryption techniques that rely on S-boxes. In general, this technique aims to achieve optimal values.

Efficient and secure image encryption using key substitution process with discrete wavelet transform

Over the past few years, there has been a rise in the utilization of chaotic encryption algorithms for securing images. The majority of chaos-based encryption algorithms adhere to the conventional model of confusion and diffusion, which typically involves either implementing multiple encryption rounds or employing a single round of intricate encryption to guarantee robust security. However, such kind of approaches reduces the computational efficiency of the encryption process but compromises security. There is a trade-off between security and computational efficiency. Prioritizing security may require high computational processes. To overcome this issue, a key substitution encryption process with discrete wavelet transform (KSP-DWT) is developed in the proposed image encryption technique (IET). Based on KSP-DWT and IET, the abbreviation of the proposed work is used in this paper as KSP-DWT-IET. The proposed KSP-DWT algorithm employs a key scheming technique to update the initial keys and uses a novel substitution method to encrypt digital images of different sizes. Additionally, the integration of DWT can result in the compression of frequency sub-bands of the source image, leading to lower computational overheads without compromising the security of the encryption. The KSP-DWT-IET performs a single encryption round and is highly secure and efficient. The simulation results and security analysis conducted on KSP-DWT-IET confirm its effectiveness in ensuring high-security image encryption while minimizing computational overhead. The proposed encryption technique undergoes various security analyses, including entropy, contrast, correlation, energy, NPCR (Number of Pixel Changes Rate), UACI (Unified Average Change Intensity) and computational complexity. The statistical values obtained for such parameters are 7.9991, 10.9889, 0.0001, 0.0152, 33.6767, and 33.6899, respectively, which indicate that the encryption technique performs very well in terms of security and computational efficiency. The proposed encryption scheme is also analyzed for its computational time in addition to its security. The analysis shows that the scheme can efficiently encrypt images of varying sizes with a high level of security in a short amount of time (i.e., 2 ms). Therefore, it is feasible to use this encryption scheme in real-time applications without causing any significant delays. Moreover, the key space of the proposed encryption scheme is large enough (i.e. Keyspace >2100) to resist the brute force attack.

An Enhanced Security in Medical Image Encryption Based on Multi-level Chaotic DNA Diffusion

A novel medical image encryption technique has been proposed based on the features of DNA encodingdecoding in combination with Logistic map approach. The approach is proven for encryption of highly sensitive medical images with 100 percent integrity or negligible data loss. Testing is done on both high and low-resolution images. Proposed encryption technique consists of two levels of diffusion using the actual structure of the DNA. In the first level of diffusion process, we have used DNA encoding and decoding operations to generate DNA sequence of each pixel. The originality of the work is to use a long DNA structure stored in a text file stored on both sender and receiver’s end to improve the performance of the proposed method. In this initial level of diffusion, DNA sequences are generated for each pixe-land in each of the DNA sequence. Index values are obtained by employing a search operation on the DNA structure. This index values are further modified and ready to be used for next diffusion process. In the second level diffusion, a highly chaotic logistic map is iterated to generate sequences and is employed to extract the chaotic values to form the cipher images. The correlation coefficient analysis, Histogram analysis, Entropy analysis, NPCR, and UACI exhibit significant results. Therefore; the proposed technique can play an important role in the security of low-resolution medical images as well as other visible highly sensitive images.

HİPERKAOTİK HARİTA VE GENETİK OPERATÖRLERE DAYALI YENİ BİR GÖRÜNTÜ ŞİFRELEME YÖNTEMİ

This paper presents a novel and secure image encryption method. The plain image’s pixels are confused using the N-point crossover operation of genetic algorithms. Randomly paired rows and columns are determined by the two state variables of a six-dimensional hyperchaotic map. The number of crossover points, which are calculated by the two other state variables of the hyperchaotic map, differ from each other for each row or column pair. The crossover positions are specified according to the number of crossover points with the help of the last two state variables. The proposed algorithm generates the diffusion stage’s encryption key using the SHA-256 hash value of the plain image. Mutation and crossover operators are implemented using the 16-bit subblocks of the 256-bit hash value. The scrambled image’s pixels are altered with the generated encryption key and previously encrypted pixels. Keyspace and sensitivity, histogram, correlation, information entropy, differential, data loss, noise attack, and computational time analyzes are performed to test the safety and effectiveness of the encryption method. The experiments and simulation results show that the proposed encryption technique is highly secure and efficient since it can resist various attacks.

Efficient Region of Interest Encryption Based on a New Chaotic Map

The recent advances in digital imaging and transmission over network demand a secure and efficient image encryption system. Traditional cryptographic algorithms encrypt full image, however only some part of the image is important and needs complex encryption algorithm to provide security. To address this issue, we have proposed a novel encryption technique based on YOLOv2 object detection and proposed Gauss-Square Cosine (GSC) chaotic map. YOLOv2 is used to divide the image into region of interest (ROI) and noncritical region. SHA2-256 hash of scrambled noncritical region is then used as an initial value of GSC chaotic map to encrypt ROI. ROI encryption technique uses pixel permutation to decorrelate adjacent pixels and random substitution to change pixel values. Differential and statistical analysis demonstrate the complexity of proposed chaotic map and robustness of proposed technique against various security attacks. Thus the proposed encryption technique is secure and efficient for large-sized images.

A Novel Technique for Secure Data Cryptosystem Based on Chaotic Key Image Generation

The advancements in Information and Communication Technology (ICT), within the previous decades, has significantly changed people’s transmit or store their information over the Internet or networks. So, one of the main challenges is to keep these information safe against attacks. Many researchers and institutions realized the importance and benefits of cryptography in achieving the efficiency and effectiveness of various aspects of secure communication.This work adopts a novel technique for secure data cryptosystem based on chaos theory. The proposed algorithm generate 2-Dimensional key matrix having the same dimensions of the original image that includes random numbers obtained from the 1-Dimensional logistic chaotic map for given control parameters, which is then processed by converting the fractional parts of them through a function into a set of non-repeating numbers that leads to a vast number of unpredicted probabilities (the factorial of rows times columns). Double layers of rows and columns permutation are made to the values of numbers for a specified number of stages. Then, XOR is performed between the key matrix and the original image, which represent an active resolve for data encryption for any type of files (text, image, audio, video, … etc). The results proved that the proposed encryption technique is very promising when tested on more than 500 image samples according to security measurements where the histograms of cipher images are very flatten compared with that for original images, while the averages of Mean Square Error is very high (10115.4) and Peak Signal to Noise Ratio is very low (8.17), besides Correlation near zero and Entropy close to 8 (7.9975).

A Novel Chaotic Permutation-Substitution Image Encryption Scheme Based on Logistic Map and Random Substitution

Privacy is a serious concern related to sharing videos or images among people over the Internet. As a method to preserve images’ privacy, chaos-based image encryption algorithms have been used widely to fulfil such a requirement. However, these algorithms suffer from a low key-space, significant computational overhead, and a lag in resistance against differential attacks. This paper presents a novel chaos-based image encryption method based on permutation and substitution using a single Substitution Box (S-Box) to address issues in contemporary image encryption algorithms. The proposed encryption technique’s efficiency is validated through extensive experiments as compared to the state-of-the-art encryption algorithms using different measures and benchmarks. Precisely, the collected results demonstrate that the proposed technique is more resilient against well-known statistical attacks and performs well under plaintext attacks. Indeed, the proposed scheme exhibits very high sensitivity concerning the plaintext attack. A minor change in the encryption key or the plain text would result in a completely different encrypted image.

A proposed encryption technique of different texts using circular link lists

A different texts encryption technique is presented in this paper. The sensitive information is encrypted in different manner via using circular link lists as data structure that contains different encryption algorithms such as: LU and LEE, Rabin, Okamoto-Uchiyama, McEliece and Paillier algorithms. Using circular link lists as data structure aims for making the information ciphering most secure. The main idea of using circular link lists is making each character of sensitive information will encrypt by different cipher method in each iteration of encryption process. The above encryption algorithms are scheduled in circular link lists and selected via execution process respectively. The sensitive information that used in this work are consist of English and Arabic texts. So, the special characters and symbols are considered. The merge text from different languages such as English and Arabic with its special characters and symbols is encrypted effectively. When a different text encryption technique is implemented, the experimental results illustrate the high level of security, the ability to cipher merge texts and efficiency. The security, integrity and complexity are satisfied in this work.

A proposed encryption technique of different texts using circular link lists

A different texts encryption technique is presented in this paper. The sensitive information is encrypted in different manner via using circular link lists as data structure that contains different encryption algorithms such as: LU and LEE, Rabin, Okamoto-Uchiyama, McEliece and Paillier algorithms. Using circular link lists as data structure aims for making the information ciphering most secure. The main idea of using circular link lists is making each character of sensitive information will encrypt by different cipher method in each iteration of encryption process. The above encryption algorithms are scheduled in circular link lists and selected via execution process respectively. The sensitive information that used in this work are consist of English and Arabic texts. So, the special characters and symbols are considered. The merge text from different languages such as English and Arabic with its special characters and symbols is encrypted effectively. When a different text encryption technique is implemented, the experimental results illustrate the high level of security, the ability to cipher merge texts and efficiency. The security, integrity and complexity are satisfied in this work.

Preserving Image Encryption for Smart Android System

This paper proposes an image encryption technique for smart phones devices to encrypt images and then upload on the cloud. The process of retrieving and decrypting images will be under full control by the user. Also, if the user wants to retrieve an image, he can retrieve it completely, but not as he needed. Our research can solve two main issues in current mobile applications which will protect photo that will be decrypt by the user only, and will help the user to recover the photo needed. An encryption mechanism based on hybrid between elementary cellular automata (ECA) and RC4 algorithms are used to encrypt images on the smart android mobiles. Experimental results on the application showed that our proposed encryption technique used for image encryption has a good quality en cryption with secure requirements.

Chaotic Jerk System with Hump Structure for Text and Image Encryption Using DNA Coding

Nowadays, advances in technology have led to the expansion of the use and exchange of digital data, which places great importance on the security of these data. The protection of exchanging messages, passwords of email accounts, bank accounts and many others requires the security of textual data. Likewise, the security of medical images, personal images, captures from military satellites, plans to build banks and many others require the protection of digital images. Thereby, jointly based on the special randomness generated by a chaotic Jerk system with hump structure and DNA coding, a cryptosystem is proposed in this article for both text and image encryption. A preliminary study on the dynamic properties of a Jerk system as well as DNA coding is carried out, respectively, for the exploration of the phenomena and the implementation of the encryption technique. Through standard nonlinear analysis tools, the full dynamics of the system is explored and feasibility is confirmed through PSpice investigations. The simulated experimental results, as well as the security analysis, show quantitatively and qualitatively that the proposed encryption technique does not only offer better performance in comparison with some existing algorithms but is also sufficiently fast for practical applications while resisting the known attacks but also.

Dynamical Properties of Ion-Acoustic Waves in Space Plasma and Its Application to Image Encryption

The nonlinear ion-acoustic waves (IAWs) in a space plasma are capable of exhibiting chaotic dynamics which can be applied to cryptography. Dynamical properties of IAWs are examined using the direct method in plasmas composed of positive and negative ions and nonextensive distributed electrons. Applying the wave transformation, the governing equations are deduced into a dynamical system (DS). Supernonlinear and nonlinear periodic IAWs are presented through phase plane analysis. The analytical periodic wave solution for IAW is obtained. Under the influence of an external periodic force, the DS is transformed to a perturbed system. The perturbed DS describes multistability property of IAWs with change of initial conditions. The multistability behavior features coexisting trajectories such as, quasiperiodic, multiperiodic and chaotic trajectories of the perturbed DS. The chaotic feature in the perturbed DS is supported by Lyapunov exponents. This interesting behavior in the windows of chaotic dynamics is exploited to design efficient encryption algorithm. First SHA-512 is used to compute the hash digest of the plain image which is then used to update the initial seed of the chaotic IAWs system. Note that SHA-512 uses one-way function to map input data to the output, consequently it is quite impossible to break the proposed encryption technique. Second DNA coding is used to confuse and diffuse the DNA version of the plain image. The diffused image follows DNA decoding process leading to the cipher image. The security performance is evaluated using some well-known metrics and results indicate that the proposed cryptosystem can resist most of existing cryptanalysis techniques. In addition complexity analysis shows the possibility of practical implementation of the proposed algorithm.

Color multiple image encryption scheme based on 3D-chaotic maps

In many research areas, production of images is increasing with every day. These days, the prime focus of researchers is on the security of digital images. Motivated by gray multiple image encryption algorithms, this paper suggests a novel Chaos-based color multiple image encryption technique. A 3D histogram equalization method has been applied to equalize the chaotic sequences histograms of Lorenz system. Confusion/diffusion of image data has been implemented by using sequences generated by histogram equalized Lorenz and Rossler system. In confusion stage, the input image colored pixels have been scrambled. Then in diffusion stage, pixel replacement is done by scrambled images and sequences of Rossler system. The proposed scheme efficiency is validated via key sensitivity, key space, entropy, horizontal, vertical, diagonal correlation, UACI and NPCR tests. Furthermore, the overall security analysis and experimental results show that the proposed encryption technique has achieved confidentiality and have resistance against classical attacks.

High security OFDM-PON with a physical layer encryption based on 4D-hyperchaos and dimension coordination optimization.

In this article we have enhanced the security of an orthogonal frequency division multiplexed passive optical network (OFDM-PON) based on four dimensional (4D) encryption, including constellation, subcarrier, symbol and time, which is proposed for the first time in this paper. 4D-hyperchaotic mapping is used to generate four masking factors to achieve ultra-high security encryption in four different dimensions. During the encryption, dimension coordination optimization is adopted, which effectively reduces the time cost of the system and improves the encryption efficiency by 3 times. At the same time, probabilistic shaping (PS) technology is used to further optimize the system that has effectively improved the bit error performance by about 1 dB. The proposed encryption technique for OFDM-PON has been demonstrated successfully with the help of experiments. The generated OFDM signal is modulated by the quadrature amplitude modulation (QAM) technique, which transmitted 16 Gb/s data rate across a 25 km fiber span of standard single-mode fiber. The values of bit error rate (BER) and peak-to-average-power ratio (PAPR) are analyzed during the experiments, and the obtained results show that the proposed security-enhanced OFDM-PON has high sensitivity and security and can be well compatible with PS and OFDM technologies. The proposed scheme has very reliable security performance and also has excellent benefit improvement, which is very promising in the future PS-OFDM-PON.

K-RSA: Secure data storage technique for multimedia in cloud data server

Cloud has become one of the most demanding services for data storage. On another hand, the security of data is one of the challenging tasks for Cloud Service Provider (CSP). Cryptography is one of the ways for securing the storage data. Cryptography is not a new approach instead of the efficient utilization of cryptographical algorithms is greatly needed. In this work, we proposed a Secure Hidden Layer (SHL) and Application Programming Interface (API) for data encryption. The SHL is consisting of two major modules (i) Key Management Server (KMS) and (ii) Share Holder Server (SHS) which is used for storing and sharing of cryptographic key. For this purpose, we proposed a server-side encryption algorithm, which is based on the asymmetric algorithm (RSA and CRT) for providing end-to-end security of multimedia data. The experimental results of text and video are evidence that the size of file is not much affected after the encryption and effectively stored at Cloud Storage Server (CSS). The parameters like ciphertext size, encryption time and throughput are considered for performance evaluation of the proposed encryption technique.

A Color Image Encryption Technique Based on Bit-Level Permutation and Alternate Logistic Maps

Abstract The paper presents an approach to encrypt the color images using bit-level permutation and alternate logistic map. The proposed method initially segregates the color image into red, green, and blue channels, transposes the segregated channels from the pixel-plane to bit-plane, and scrambles the bit-plane matrix using Arnold cat map (ACM). Finally, the red, blue, and green channels of the scrambled image are confused and diffused by applying alternate logistic map that uses a four-dimensional Lorenz system to generate a pseudorandom number sequence for the three channels. The parameters of ACM are generated with the help of Logistic-Sine map and Logistic-Tent map. The intensity values of scrambled pixels are altered by Tent-Sine map. One-dimensional and two-dimensional logistic maps are used for alternate logistic map implementation. The performance and security parameters histogram, correlation distribution, correlation coefficient, entropy, number of pixel change rate, and unified averaged changed intensity are computed to show the potential of the proposed encryption technique.

Image compression and encryption using chinese remainder theorem

The proposed encryption technique uses Chinese Remainder Theorem (CRT) and hash map to generate and distribute secret co-prime keys to participants. It utilizes the fact that CRT gives a unique solution for the set of congruent equations if and only if the modulus values are relatively co-prime to each other i.e., Greatest Common Divisor (GCD) of moduli is equal to 1. In this paper, we have proposed secret image sharing scheme using CRT and obtained results on grayscale images of different dimensions. The proposed technique not only increases randomness in encrypted image but also compresses the image, resulting in easy storage and fast transmission. As compression ratio is dependent on shared keys, all shared keys are essential for recovering image without any noise, absence of any key gives an image which is deviated from our original image. For r participants, r pixels are encrypted and compressed simultaneously at a time using CRT which gives one encrypted unique value corresponding to those r pixels. As this encrypted value can be greater than 255, hash map is used to store this value. The experimental results show that the encrypted image is compressed, is not disclosing any secret information and recovery of original image is loss-less.

A novel approach to encrypt multiple images using multiple chaotic maps and chaotic discrete fractional random transform

Due to recent advances in network technology, it has become easier to send multiple images together. Hence, image encryption using multiple images is an emerging area of interest amidst researchers. The paper proposes a multiple-image encryption technique based on the chaotic confusion-diffusion strategy and chaotic Discrete Fractional Random Transform (DFRNT). Initially, odd and even bits of three input images (M × N) are separated and a composite image (3M × 2N) is derived by combining the even and odd bits of every image. Secondly, chaotic confusion-diffusion strategy using four chaotic maps Arnold Cat Map (ACM), Logistic-Tent Map (LTM), Logistic-Sine Map (LSM) and Tent-Sine Map (TSM) is applied to scramble and diffuse the pixel values of the composite image. Thereafter, three diffused images are extracted from the diffused composite image. Finally, chaotic DFRNT uses Tent-Sine Map (TSM) to generate the random kernel transform matrix for itself and encrypt the extracted images into a single image. The parameters Histogram, Correlation distribution (CD), Correlation Coefficient (CC), Entropy, Number of Pixel Change Rate (NPCR) and Unified Averaged Changed Intensity (UACI) have been computed to show the potential of the proposed encryption technique.