A chess-based chaotic block cipher

Abstract

This paper presents a new and efficient block cipher encryption system, which includes confusion as well as diffusion processes. While the confusion process is based on the Lorenz chaotic generator, the diffusion process is chess-based. By utilizing the chess horse movement rules, the diffusion process increases the encryption complexity and improves the differential attack measures. Furthermore, combining chaotic and chessbased algorithms increases the length of the encryption key and, hence, makes brute force attacks infeasible. The encryption system is analyzed using miscellaneous evaluation criteria such as pixel correlation coefficients, differential attack measures, histograms and the NIST statistical test suite. Key sensitivity analysis is also performed and the mean square error and entropy measures are calculated. In addition, several examples are presented for different block sizes showing promising results.

A Novel Image Encryption Algorithm Based on the Two-Dimensional Logistic Map and the Latin Square Image Cipher

“…Whereas Zhang et al [26] used compressive sensing along with Arnold's map in order to encrypt color images into grey images, Zhang et al [27] used a coupled logistic map, self adaptive permutation, substitution boxes and combined global diffusion to perform the encryption. Finally, AbdEl Haleem et al [28] used a chess-based algorithm to perform the permutation process and the Lorenz system to perform the substitution process. In summary, permutations and substitutions can be performed using chaotic systems, non-chaotic algorithms or a combination of both.…”

Pixel Permutation Using Chaotic Perfect Shuffle Technique for Image Encryption

“…Typical scheme for image encryption is that it contains substitution and permutation stages aiming at fulfilling confusion and diffusion characteristics which are due to Shannon [11]. The latter or permutation stage alters the places by employing chaotic or non-chaotic generators [12], [13], [14]. The former or substitution stage alters the pixels values employing a generator of pseudo random number or two other techniques [15], [16], [17].…”