Hao Zhang

Bio: Hao Zhang is an academic researcher from Taiyuan University of Technology. The author has contributed to research in topics: Encryption & Scrambling. The author has an hindex of 1, co-authored 3 publications receiving 1 citations.

A new image encryption algorithm based on Latin square matrix

Abstract: An image encryption algorithm based on Latin square array, instead of the traditional 2D Freidrich architecture, is proposed here. First, two Latin square matrices are used to scrambling and diffusion of the image on the basis of rows and columns. That is, after completing the scrambling and diffusion of the column, the scrambling and diffusion of the row, following those of column, will not stop until all the rows and columns are encrypted. Second, the entire image is subjected to a diffusion operation opposite to the first step line encryption sequence for a further encryption. This algorithm only carries out one-round encryption operation, but simulation experiment results and security analysis show that the algorithm passes statistical tests such as correlation and information entropy, can resist conventional attacks, and is sensitive to keys, so the algorithm has strong security.

Color image encryption algorithm based on Fisher-Yates scrambling and DNA subsequence operation

Abstract: In this paper, a color image encryption algorithm based on Fisher-Yates scrambling and DNA subsequence operation (elongation operation, truncation operation, deletion operation, insertion arithmetic) is proposed. Firstly, the three-dimensional color image is transformed into two-dimensional gray image, and the chaotic sequence generated by Chen system and Fisher-Yates scrambling method is used to scramble the plaintext images of R, G and B channels. Secondly, the three channel images of the scrambled plaintext image are transformed into three DNA sequence matrixes by using the DNA coding rules, and then the three DNA sequence matrixes are manipulated by using DNA subsequence operation and DNA addition, subtraction and XOR operation to destroy the scrambled plaintext information. Finally, the color encrypted image is obtained by using the DNA decoding rule. Experimental results and security analysis demonstrate that our encryption algorithm has good performance and may resist against various typical attacks.

A new hybrid image encryption algorithm based on Gray code transformation and snake-like diffusion

Abstract: Because Gray code has good spatial traversal and easy to generate binary conversion, this paper proposes an image encryption algorithm based on Gray code scrambling. Firstly, the Lorenz system is used to generate chaotic sequences for binary and Gray code transformation to achieve global scrambling. Different from the traditional row (column) XOR method, this paper uses the snake shape to diffuse the row (column) XOR. The lines of the scrambled image are first XORed from left to right in a serpentine order, and the row elements are cyclically shifted. Then, the columns of the image are XORed from right to left in a serpentine order, and the column elements are cyclically shifted. Finally, the scrambled image is further diffused. The comparative experiment shows that the algorithm has good encryption effect. Not only is it well resistant to differential cryptanalysis and exhaustive attack, but it also improves key sensitivity.

An efficient image encryption scheme using Gray code based permutation approach, Optics and Lasers in Engineering

Abstract: Abstract In recent years, the operation efficiency of chaos-based image cryptosystems has drawn much more concerns. However, the workload arised from floating point arithmetic in chaotic map iteration prevents the efficiency promotion of these cryptosystems. In this paper, we present a novel image encryption scheme using Gray code based permutation approach. The new permutation strategy takes full advantage of (n, p, k)-Gray-code achievements, and is performed with high efficiency. A plain pixel-related image diffusion scheme is introduced to compose a complete cryptosystem. Simulations and extensive security analyses have been carried out and the results demonstrate the high security and operation efficiency of the proposed scheme.

A Chaotic Image Encryption Scheme Based on Genetic Central Dogma and KMP Method

Abstract: In this paper, an image cryptosystem based on genetic central dogma (GCD), Knuth–Morria–Pratt (KMP) algorithm and a chaotic system is developed. The KMP algorithm is firstly used to bind DNA strings to obtain the next array, which participates in the design of the chaotic initial condition, and then the secure chaotic sequences are produced by employing the sliding idea in pattern string matching. In the present procedure, a DNA-level two-way pixel’s shuffle is achieved by a shared stack push operation and it is adopted in the permutation module for the purpose of accelerating the overall pixel’s shuffle. Subsequently, the pixel values are substituted by simulating the process of protein synthesis in GCD, in which the DNA replication and RNA replication form the basis of the DNA-triploid mutation and new RNA mutation rules, respectively. Experimental simulations and extensive cryptanalysis fully vindicate that superior security effects in addition to satisfactory low time complexity can be simultaneously obtained by the proposed confusion-substitution scheme.

A New Chaotic Image Encryption Algorithm Based on Transversals in a Latin Square

Abstract: In this paper, a new combinatorial structure is introduced for image encryption, which has an excellent encryption effect on security and efficiency. An n-transversal in a Latin square has the function of classifying all the matrix’s positions, and it can provide a pair of orthogonal Latin squares. Employing an n-transversal of a Latin square, we can permutate all the pixels of an image group by group for the first time, then use two Latin squares for auxiliary diffusion based on a chaotic sequence, and finally, make use of a pair of orthogonal Latin squares to perform the second scrambling. The whole encryption process is “scrambling–diffusion–scrambling”. The experimental results indicated that this algorithm passed various tests and achieved a secure and fast encryption effect, which outperformed many of the latest papers. The final information entropy was very close to 8, and the correlation coefficient was approximately 0. All these tests verified the robustness and practicability of the proposed algorithm.