Parallel Image Encryption Research Articles

A novel single kernel parallel image encryption scheme based on a chaotic map

A novel single kernel parallel image encryption scheme based on a chaotic map

A parallel image encryption algorithm using intra bitplane scrambling

More and more privacy-sensitive images have been produced daily. Chaotic encryption guarantees that only the targeted receiver can obtain the raw image. Many works perform encryption on bit-level for better permutation but incur an unbearable time consumption caused by generating additional 3D coordinates. High-dimensional chaotic system, suitable for encrypting images, needs to iterate repeatedly for several rounds, resulting in low encrypting efficiency. This paper proposes a parallel image encryption algorithm using intra bitplane scrambling. Four threads are utilized to encrypt the images in bit-level during the permutation, where each thread scrambles two bitplanes. In diffusion, we build multiple threads to generate keystream segments to reduce encryption time. We make cryptographic analyses and compare the encryption speed with the advanced works, demonstrating that our scheme is secure and efficient.

A Novel Parallelizable Chaotic Image Encryption Scheme Based on Elliptic Curves

Most of the computational time in many chaotic image encryption schemes is spent generating the required chaotic sequences. Since chaotic systems are defined by recurrence relations, they are often generated sequentially. In this paper, we propose a chaotic image encryption scheme which enables pixel-level parallelism to boost the computational speed of generating chaotic sequences. We use a group defined over elliptic curve (EC) points and the addition operator to generate a discrete chaotic sequence and use it to construct an image encryption scheme. The proposed scheme is designed such that encryption and decryption operations are highly parallelizable to take advantage of readily available parallel processing platforms such as GPU acceleration, DSPs and multi-core CPUs. Complexity analysis indicates that the proposed scheme is more efficient than existing EC-based image encryption schemes. Practical experiments on a quad-core CPU show that the proposed scheme can achieve a speedup of 3.93, confirming its superior parallelization efficiency in comparison with existing parallel image encryption schemes. We also provide detailed analysis of the immunity of the proposed scheme to all common cryptanalysis attacks. Results reveal that the proposed technique shows promising performance in terms of security and efficiency.

Parallel Encryption of Noisy Images Based on Sequence Generator and Chaotic Measurement Matrix

With the rapid development of information technology in today’s society, the security of transmission and the storage capacity of hardware are increasingly required in the process of image transmission. Compressed sensing technology can achieve data sampling and compression at the rate far lower than that of the Nyquist sampling theorem and can effectively improve the efficiency of information transmission. Aiming at the problem of weak security of compressed sensing, this study combines the cryptographic characteristics of chaotic systems with compressed sensing technology. In the actual research process, the existing image encryption technology needs to be applied to the hardware. This paper focuses on the combination of image encryption based on compressed sensing and digital logic circuits. We propose a novel technology of parallel image encryption based on a sequence generator. It uses a three-dimensional chaotic map with multiple stability to generate a measurement matrix. This study also analyzes the effectiveness, reliability, and security of the parallel encryption algorithm for source noise pollution with different distribution characteristics. Simulation results show that parallel encryption technology can effectively improve the efficiency of information transmission and greatly enhance its security through key space expansion.

A novel parallel image encryption algorithm based on hybrid chaotic maps with OpenCL implementation

Since chaotic maps have the excellent properties of unpredictability, ergodicity and sensitivity to their parameters and initial values, they are quite suitable for generating chaotic sequences for securing communication systems and are also especially useful for securing images, and a lot of chaotic map-based image encryption algorithms have been proposed. But some existing image encryption algorithms were proved that their security, encryption efficiency or computational speeds are not quite satisfactory for practical applications. Some of them using only one type of chaotic system may suffer from low key space, and some others using two or more types of chaotic system may suffer from high computational overheads. In this paper, based on the classic 1D logistic map, a 2D one-coupling logistic dynamics system and OpenCL, a novel parallel image encryption algorithm HCMO is proposed. Our algorithm consists of a confusion phase and a diffusion phase using four sub-key matrices based on the hybrid logistic dynamics systems, the linear transformation and the enlarging operation. In the confusion phase, the image’s pixel positions are first scrambled by performing row-wise and column-wise permutation operations using two sub-key matrices; then, in its diffusion phase, both the bit XOR operation and the bit cyclic shifting are applied onto the scrambled intermediate image matrix using the other two sub-key matrices. In order to reduce the whole encrypting execution time, we speed up our HCMO on an OpenCL’s heterogeneous and parallel characteristics. Compared to the implementation of Vihari’s algorithm and some other chaotic map-based algorithms referred in this paper with the OpenCL-based implementation on the CPU and on the GPU, respectively, our algorithm’s simulation demonstrates remarkable improvement in the operational speedup, and the experimental result analyses have also shown that HCMO has a higher-level security than some other referred algorithms.

Fast image encryption algorithm based on parallel computing system

To ensure security, image encryption algorithms generally include two stages: permutation and diffusion. The traditional image permutation algorithms include the sort-based permutation algorithm, Arnold-based permutation algorithm, Baker-based permutation algorithm and the cyclic shift permutation algorithm, etc. However, these algorithms have the disadvantages of either high time complexity or poor permutation performance. Therefore, in combination with cyclic shift and sorting, this paper proposes a permutation algorithm that can not only guarantees good permutation performance but also guarantee low time and space complexity. Most importantly, this paper proposes a parallel diffusion method. This method ensures the parallelism of diffusion to the utmost extent and achieves a qualitative improvement in efficiency over traditional streaming diffusion methods. Finally, combined with the proposed permutation and diffusion, the paper proposes a computational model for parallel image encryption algorithms.

A novel parallel image encryption algorithm based on chaos

With rapid technology development, data sizes are increasing and more powerful hardware structures are needed to process these data. An alternative solution for this process is to parallel the transactions to be realized, to provide the time gain, increase the efficiency and reduce the transaction costs. In this article, a new chaos-based parallel encryption algorithm design is presented to meet this requirements. In the study, a new random number generator (RNG) and chaos-based parallel encryption algorithm are developed. Using developed RNG, confusion and encryption of pixel in images have been realized. Also parallel computing has been used to increase security and speedup the encryption. With the new parallel encryption algorithm, the security and performance tests of the image encryption application and the encryption process have been made. In addition, the evaluated performance of the parallel computing is described in speedup and efficiency.

Parallel image encryption with bitplane decomposition and genetic algorithm

Image encryption is an efficient technique to protect image content from unauthorized parties. In this paper a parallel image encryption method based on bitplane decomposition is proposed. The original grayscale image is converted to a set of binary images by local binary pattern (LBP) technique and bitplane decomposition (BPD) methods. Then, permutation and substitution steps are performed by genetic algorithm (GA) using crossover and mutation operations. Finally, these scrambled bitplanes are combined together to obtain encrypted image. Instead of random population selection in GA, a deterministic method with security keys is utilized to improve security level. The proposed encryption method has parallel processing capability for multiple bitplanes encryption. This distributed GA with multiple populations increases encryption speed and makes it suitable for real-time applications. Simulations and security analysis are done to demonstrate efficiency of our algorithm.

A parallel image encryption algorithm based on the piecewise linear chaotic map and hyper-chaotic map

This paper proposes a parallel digital image encryption algorithm based on a piecewise linear chaotic map (PWLCM) and a four-dimensional hyperchaotic map (FDHCM). Firstly, two decimals are obtained based on the plain-image and external keys, using a novel parallel quantification method. They are used as the initial value and control parameter for the PWLCM. Then, an encryption matrix and four chaotic sequences are constructed using the PWLCM and FDHCM, which control the permutation and diffusion processes. The proposed algorithm is implemented and tested in parallel based on a graphics processing unit device. Numerical analysis and experimental results show that the proposed algorithm achieves a high encryption speed and a good security performance, which provides a potential solution for realtime image encryption applications.

A parallel image encryption algorithm based on chaotic Duffing oscillators

Image encryption has been a popular research field in recent decades. This paper presents a novel parallel image encryption algorithm, which is based on the chaotic duffing oscillators. Image encryption systems based on chaotic Duffing oscillators are show some better performances. In order to be more efficient and secure, we divided the plain-images (original-image) into several pieces. The speed of encryption and decryption is very fast. We use well-known ways to perform the security and performance analysis of the proposed image encryption scheme. The results of the fail-safe analysis are inspiring and it can be concluded that, the proposed scheme is efficient and secure.

A novel parallel image encryption with chaotic windows based on logistic map

Over the course of the last two decades, secure communication has become a very important issue due to the rapid growth of information technology and the development of public communication networks in which digital images are widely transmitted. In this paper, logistic map was employed for the encryption of gray-scale images. The proposed algorithm, demonstrating a proper performance according to the experimental results, divides the image into blocks and encrypts them with XOR operation and chaotic windows. Moreover, it has a large key space and the resulted encrypted images have homogeneous histograms. The large-enough NPCR and UACI of this algorithm indicate its resistance to differential attacks, not to mention the fact that it is suitable for noisy communication networks and could be made use of in parallel processing.

A parallel image encryption method based on compressive sensing

Recently, compressive sensing-based encryption methods which combine sampling, compression and encryption together have been proposed. However, since the quantized measurement data obtained from linear dimension reduction projection directly serve as the encrypted image, the existing compressive sensing-based encryption methods fail to resist against the chosen-plaintext attack. To enhance the security, a block cipher structure consisting of scrambling, mixing, S-box and chaotic lattice XOR is designed to further encrypt the quantized measurement data. In particular, the proposed method works efficiently in the parallel computing environment. Moreover, a communication unit exchanges data among the multiple processors without collision. This collision-free property is equivalent to optimal diffusion. The experimental results demonstrate that the proposed encryption method not only achieves the remarkable confusion, diffusion and sensitivity but also outperforms the existing parallel image encryption methods with respect to the compressibility and the encryption speed.

Parallel image encryption algorithm based on discretized chaotic map

Recently, a variety of chaos-based algorithms were proposed for image encryption. Nevertheless, none of them works efficiently in parallel computing environment. In this paper, we propose a framework for parallel image encryption. Based on this framework, a new algorithm is designed using the discretized Kolmogorov flow map. It fulfills all the requirements for a parallel image encryption algorithm. Moreover, it is secure and fast. These properties make it a good choice for image encryption on parallel computing platforms.