Compressive sensing based image compression-encryption using Novel 1D-Chaotic map

Recently, due to the initial sensitivity, ergodicity, boundedness, and unpredictability of chaos, it has been widely used in the fields of secure communication, signal processing, chaotic synchronization, etc. Moreover, due to the low complexity of hardware implementation, widespread attention to one-dimensional (1D) chaotic maps has been paid from researchers. However, some existing 1D maps have simple chaotic behaviors and discrete chaotic intervals, which have significantly affected the practical application. To address these shortcomings, this paper proposes a 1D chaotic model based on the absolute value function and the cosine function called the cosine-coupled chaotic model (CCCM). It can use existing 1D chaotic maps as seed maps to construct a series of 1D chaotic maps with continuous chaotic intervals and complex chaotic behaviors. To verify the effectiveness of the CCCM, we first generate three new chaotic maps using the CCCM, and then their chaotic properties are analyzed by using various measures including Lyapunov exponent (LE), sample entropy (SE), correlation dimension (CD), 0-1 test and sensitivity. The experimental results confirm that the new chaotic maps have wider chaotic intervals and more complex chaotic behaviors than the corresponding seed maps and some other advanced chaotic maps. Then we use a field programmable gate array (FPGA) as the hardware platform for simple hardware implementations of the new chaotic maps. And a new pseudo-random number generator (PRNG) is introduced to verify practical applications of the new maps. Finally, experimental results show that the new chaotic maps can be implemented on FPGA and the proposed PRNG has strong random properties.

This paper introduces a novel parameter-control framework to produce many new one-dimensional (1D) chaotic maps. It has a simple structure and consists of two 1D chaotic maps, in which one is used as a seed map while the other acts as a control map that controls the parameter of the seed map. Examples and analysis results show that these newly generated chaotic maps have more complex structures and better chaos performance than their corresponding seed and control maps.

RGB image encryption based on symmetric keys using Arnold transform, 3D chaotic map and affine hill cipher

In this paper, a chaotic image encryption algorithm is suggested combining with double chaotic maps, SHA‐3 (Secure Hash Algorithm‐3), and auto‐updating system. To shuffle pixel positions, a matrix having same size of the plain‐image is generated dependent on the plain‐image in stage of permutation. Then, SHA‐3 is taken to calculate its hash values used to produce control parameter and initial condition of Logistic map. After that, total permutation is implemented for row and column to exchange pixels, where auto‐updating systems are established by different images acting like one‐time pad. Furthermore, 3D chaotic cat map is employed to enlarge key space in diffusion process. Permuted image is firstly divided into four sub‐blocks, which are queued randomly according to the key of Logistic map. The last sub‐block is picked out to calculate the hash values using SHA‐3, of which are assigned into three groups to update the initial conditions of 3D chaotic cat map performing like one‐time pad again. Current sub‐block is designed to influence next sub‐block in diffusion process. As a result, the proposed algorithm can resist efficiently the chosen‐plaintext and known‐plaintext attacks. Experimental results are also given to explain the high security of the proposed method. Copyright © 2016 John Wiley & Sons, Ltd.

A novel compression-based 2D-chaotic sine map for enhancing privacy and security of biometric identification systems

This paper shows a digital noise generator designed in FPGA, based on a variant of the one‐dimensional (1D) chaotic tent map (T‐1D). The T‐1D map is a piecewise linear 1D chaotic map that defines the statistical behavior of the generated sequences using its control parameter. In this way, the proposed noise generator is a highly competitive alternative in cryptographic systems when the statistical behavior of the sequences is closer to the uniform statistical distribution. The proposed system uses the inverted tent chaotic map (IT‐1D), which has the same statistical behavior as the T‐1D map. The fundamental algorithm used in this system was developed based on a 64‐bit double precision format according to the numerical representation of floating point numbers defined in the IEEE‐754 standard. The proposed system is analized using mechanical statistic tools and some statistical tests defined in the NIST 800‐22SP (USA) standard. The main contribution of this work is the possibility of generating binary sequence of pseudorandom appearance by a procedure implemented in an FPGA device that translates real numbers to natural numbers preserving the statistical properties of sequences of real numbers that can be generated with the tent chaotic map in its original definition domain.

This work utilizes a novel image encryption technique for block image encryption with the help of nonlinear 2D chaotic map and DNA sequences (NL2DCM-DNA). 2D chaotic map has generated the several key sequences for encryption, and DNA rules are applied to perform fast block encryption of image. Nonlinearity of 2D chaotic map and complexity of DNA sequences are used to perform highly secure image encryption. The experimental outputs illustrate the higher efficiency of NL2DCM-DNA in terms of security, attack resilience, entropy, histogram, running time and diffusion against some previous image encryption algorithms.

In this paper a novel data hiding method has been proposed which is based on Non-Linear Feedback Shift Register and Tinkerbell 2D chaotic map. So far, the major work in Steganography using chaotic map has been confined to image steganography where significant restrictions are there to increase payload. In our work, 2D chaotic map and NLFSR are used to developed a video steganography mechanism where data will be embedded in the segregated frames. This will increase the data hiding limit exponentially. Also, embedding position of each frame will be different from others frames which will increase the overall security of the proposed mechanism. We have achieved this randomized data hiding points by using a chaotic map. Basically, Chaotic theory which is non-linear dynamics physics is using in this era in the field of Cryptography and Steganography and because of this theory, little bit changes in initial condition makes the output totally different. So, it is very hard to get embedding position of data without knowing the initial value of the chaotic map.

A secure image steganography based on LSB technique and 2D chaotic maps

Recently, a novel bit-level color image encryption scheme based on improved one-dimension (1D) chaotic map has been proposed. It was claimed that the proposed scheme is secure due to the improved 1D chaotic map with better chaotic performance. Some security analyses and simulation experiments were presented to show that it could resist various attacks. However, we found that there are some security loopholes in the original scheme, and then proposed an effective attack strategy utilizing chosen-plaintext attack (CPA) in this paper. The proposed strategy mainly includes two attacks. The first is to obtain the equivalent secret key of the diffusion right shift phase, and the second is to obtain the permutation right shift rule. The effectiveness and feasibility of the proposed method are verified by both theoretical analyses and experimental results. Some proposals are also given for improving the security of the original encryption scheme.

Image encryption algorithm based on the finite fields in chaotic maps

The research on the balance of chaotic sequence has important significance to spread-spectrum communication. The relationship between the balance and the parameter of four typical chaotic maps (Chebyshev, improved Logistic, Logistic and Tent) was discussed. The new numeric ranges of initial value and fractal parameter were decided, which provided reference for the generation of chaotic spread-spectrum sequence. Through the graphs of the four chaotic sequences' balance and the error-bit rate performance of these systems with the four chaotic sequences' map parameters, the new numeric ranges were validated. Both simulation results and the analysis show that the balance of Chebyshev is the best.

In the last decade, the communication of images through the internet has increased. Due to the growing demands for data transfer through images, protection of data and safe communication is very important. For this purpose, many encryption techniques have been designed and developed. New and secured encryption schemes based on chaos theory have introduced methods for secure as well as fast communication. A modified image encryption process is proposed in this work with chaotic maps and orthogonal matrix in Hill cipher. Image encryption involves three phases. In the first phase, a chaotic Henon map is used for permuting the digital image. In the second phase, a Hill cipher is used whose encryption key is generated by an orthogonal matrix which further is produced from the equation of the plane. In the third phase, a sequence is generated by a chaotic tent map which is later XORed. Chaotic maps play an important role in the encryption process. To deal with the issues of fast and highly secured image processing, the prominent properties of non-periodical movement and non-convergence of chaotic theory play an important role. The proposed scheme is resistant to different attacks on the cipher image. Different tests have been applied to evaluate the proposed technique. The results of the tests such as key space analysis, key sensitivity analysis, and information entropy, histogram correlation of the adjacent pixels, number of pixel change rate (NPCR), peak signal to noise ratio (PSNR), and unified average changing intensity (UCAI) showed that our proposed scheme is an efficient encryption technique. The proposed approach is also compared with some state-of-the-art image encryption techniques. In the view of statistical analysis, we claim that our proposed encryption algorithm is secured.

We may secure the content of text, audio, image and video during their transmission from one party to another party via an open channel such as the internet by using cryptograph. Logistic-Sine System (LSS) is a combination on two 1D chaotic maps which are Logistic Map and Sine Map. By applying the LSS into cryptography, the image encryption and decryption can be performed. This study is focusing on the performance test of the image encryption and decryption processes by using the LSS. For comparison purpose, we compare the performance of the encryption and decryption by using two different chaotic systems, which are the LSS and Logistic-Tent System (LTS). The result shows that system with LSS is less efficient than LTS in term of encryption time but both systems have similar efficiency in term of decryption time.

Symmetric stream cipher with chaotic maps have been proven to be feasible and secure for digital image encryption, where 2D Cat map as well as Baker map are usually employed to permute pixels and 1D chaotic maps are employed to diffuse the values of pixels. In this paper, a new permutation method with perturbation strategy is proposed, which is used to enhance the performance of Cat map and hence the security degree of the image cryptosystem. Moreover, a chaotic orbit perturbation mechanism is introduced in diffusion procedure to further enhance the security of the cryptosystem. Intensive security analysis is carried out and the results demonstrate that the proposed cryptosystem is suitable for high secure image transmission applications.