An Image Encryption Scheme Based on Lorenz Hyperchaotic System and RSA Algorithm

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security.

Chaotic systems with pseudorandom number generate to protect the transmitted data of wireless network

<span>Communication techniques have witnessed rapid development in recent years, especially the internet and the mobile network, which led to rapid data transmission. The latest developments, in turn, have come out with advanced decisions to secure information from eavesdropping. Myriad in-depth studies in cryptography. It was implemented with the intention of proposing a revolutionary solution to protect data by encryption techniques, tend maps, and logistics. This work had proposed a new design to the generator of pseudo-random numbers (GPRN) which had utilized multi chaotic systems. Synchronization of Multi-parameters chaotic arises in many applications, in natural or industrial systems. Many methods have been introduced for using a chaotic system in the encryption of data. Analysis of security of chaotic system had been executed on key sensitivity and keyspace.</span>

An image encryption algorithm with a novel chaotic coupled mapped lattice and chaotic image scrambling technique

In this paper, we build a novel chaotic coupled lattice mapping with positive Lyapunov exponent, and introduce a novel chaotic image scrambling mechanism. Then, we propose a chaotic image encryption algorithm which uses the introduced chaotic coupled lattice mapping to apply permutation by iteratively applying the introduced chaotic image scrambling mechanism, and diffusing the pixel values. We use a sorting approach rather than quantizing the chaotic floating-point values to construct the diffusion matrix. We also study the security of the proposed algorithm concerning several security measures including brute-force attack, differential attack, key sensitivity, and statistical attacks. Moreover, the proposed algorithm is robust against data loss and noise attacks.

Color image encryption scheme based on quaternion discrete multi-fractional random transform and compressive sensing

A color image compression-encryption algorithm by combining quaternion discrete multi-fractional random transform with compressive sensing is investigated, in which the chaos-based fractional orders greatly improve key sensitivity. The original color image is compressed and encrypted with the assistance of compressive sensing, in which the partial Hadamard matrix adopted as a measurement matrix is constructed by iterating Chebyshev map instead of utilizing the entire Guassian matrix as a key. The sparse images are divided into 12 sub-images and then represented as three quaternion signals, which are modulated by the quaternion discrete multi-fractional random transform. The image blocking and the quaternion representation make the proposed cryptosystem avoid additional data extension existing in many transform-based methods. To further improve the level of security, the plaintext-related key streams generated by the 2D logistic-sine-coupling map are adopted to diffuse and confuse the intermediate results simultaneously. Consequently, the final ciphertext image is attained. Simulation results reveal that the proposed cryptosystem is feasible with high security and has strong robustness against various attacks.

Public Key Cryptosystem Based on Optimized Chaos-Based Image Encryption

Now is the era of online data and transaction, all this happens on an unsecured channel. With this huge data transfer, comes the need of protecting this data. Thus, to achieve security during transmission, several symmetric key encryption algorithms have been proposed. Inspired from researchers, we propose an asymmetric key image security algorithm based on chaotic tent map integrated with Optimized Salp Swarm Algorithm (SSA) for key generation and encryption for gray scale images. Diffusion and confusion are carried out in each round to mix plain text and key to it more secure. Experimental analysis shown by SSA are encouraging and is secure enough to resist brute force, differential cryptoanalysis and key sensitivity analysis attack and is suitable for practical application.

Multi-Scroll Chaotic System Model and Its Cryptographic Application

This paper introduces a new chaotic system model that could generate multi-direction multi-scroll (MDMS) chaotic attractors. The fundamental dynamics characteristics of this model are investigated, and the feasibility of the proposed method is confirmed by numerical simulation based on MATLAB. Additionally, the new chaotic system is implemented in FPGA-based platform. Implementation results are the same in MATLAB and FPGA, which indicates that they are suitable for practical applications. To investigate the cryptographic application of the new chaotic system, the chaotic sequences generated by the proposed system are used to encrypt images. The key space of the algorithm as well as key sensitivity, plain image sensitivity, plaintext histogram, correlation and information entropy are simulated and analyzed. In contrast to several encryption schemes, the proposed algorithm is very sensitive to plaintext and the key.

Image Encryption Scheme Based on a Generalized Arnold Map and RSA Algorithm

This study proposes a new image encryption scheme based on a generalized Arnold map and Rivest–Shamir–Adleman (RSA) algorithm. First, the parameters of the generalized Arnold map are generated by an asymmetric encryption-system RSA algorithm, and the keystream is produced iteratively. To change the distribution of pixel values, the image data are hidden by XOR diffusion. Second, both rows and columns of the image are cyclically confused to hide the image data again. Then, the additive mode diffusion operation is performed to realize third-layer hiding for image content. The overall diffusion and confusion operations are conducted twice to obtain the final cipher image. Test results prove that the encryption scheme proposed in this study is effective and has strong antiattack capabilities and key sensitivity. In addition, because the scheme security relies on the RSA algorithm, it has high security.

An Image Encryption Scheme Using Chaotic Baker Map

In this paper, we propose a new image encryption method based on Chaos Baker map and Lanczos algorithm. Two levels of security are achieved to enhance the level of image security. In the first level, the Chaotic Baker map is a randomization technique used to make the pixels more shuffled. A pseudo-random generator is used with the second-level Lanczos algorithm which is applied to generate eigenvalues and eigenvectors. The proposed method resists various attacks: plaintext attacks, maximum deviation, correlation analysis and key sensitivity. Experimental results show that this method has better time complexity when protecting images.

Image steganography using least significant bit and secret map techniques

In steganography, secret data are invisible in cover media, such as text, audio, video and image. Hence, attackers have no knowledge of the original message contained in the media or which algorithm is used to embed or extract such message. Image steganography is a branch of steganography in which secret data are hidden in host images. In this study, image steganography using least significant bit and secret map techniques is performed by applying 3D chaotic maps, namely, 3D Chebyshev and 3D logistic maps, to obtain high security. This technique is based on the concept of performing random insertion and selecting a pixel from a host image. The proposed algorithm is comprehensively evaluated on the basis of different criteria, such as correlation coefficient, information entropy, homogeneity, contrast, image, histogram, key sensitivity, hiding capacity, quality index, mean square error (MSE), peak signal-to-noise ratio (PSNR) and image fidelity. Results show that the proposed algorithm satisfies all the aforementioned criteria and is superior to other previous methods. Hence, it is efficient in hiding secret data and preserving the good visual quality of stego images. The proposed algorithm is resistant to different attacks, such as differential and statistical attacks, and yields good results in terms of key sensitivity, hiding capacity, quality index, MSE, PSNR and image fidelity.

Hybrid Image Encryption Technique Using Genetic Algorithm and Lorenz Chaotic System

One of the important application of image encryption is storing confidential and important images on a local device or a database in such a way that only the authorized party can view or perceive it. The current image encryption technique employs the genetic algorithm to increase confusion in the image, but compromises in time and space complexity. The other method employs chaos or pseudo random number generating systems which have fast and highly sensitive keys but fails to make the image sufficiently noisy and is risky due to its deterministic nature. We propose a technique which employs the non-deterministic, optimizing power of genetic algorithm and the space efficiency and key sensitivity of chaotic systems into a unified, efficient algorithm which will retain the merits of both the methods whereas tries to minimize their demerits in a software system. The encryption process proceeds in two steps, generating two keys. First, an encryption sequence is generated using Lorenz Chaotic system of differential equation. The seed values used are the user’s actual key having key sensitivity of 10-14. Second, the encrypted image’s genetic encryption sequence is generated which will result in an encrypted image with entropy value greater than 7.999 thus ensuring the image is very noisy. Proposed technique uses variations of Lorenz system seed sets to generate all random mutations and candidate solutions in Genetic encryption. Since only the seed sets leading to desired solution is stored, space efficiency is higher compared to storing the entire sequences. Using this image encryption technique we will ensure that the images are hidden securely under two layers of security, one chaotic and other non-deterministic.