Security analysis of a chaos-based image encryption algorithm

Abstract

The security of Fridrich's algorithm against brute-force attack, statistical attack, known-plaintext attack and selectplaintext attack is analyzed by investigating the properties of the involved chaotic maps and diffusion functions. Based on the given analyses, some means are proposed to strengthen the overall performance of the focused cryptosystem.

Secure Hill Cipher Modification Based on Generalized Permutation Matrix SHC-GPM

“…3, Table 1). Versus SHC/SHC-M, the proposed cipher SHC-GPM significantly increases the security, based on the greater number of dynamic keys used (see (23)). These improvements are got by expense of two-three times decreasing performance because SHC-GPM uses generalized permutations matrices which need approximately three times greater number of multiplications compared to the permutations used by SHC/SHC-M. An important feature of the proposed cipher is the use of numbers having known in advance maximal order (10) allowing guaranteeing non-repeating sequence of the key matrices of any length by respective choice of the parameters (for parameter values used in the reported experiments, the length (NDK) is given by (21)).…”

“…To prove the robustness of the proposed scheme, the statistical analysis has been performed. It is usually evaluated by the following measures [15], [17], [20], [21], [22], [23]: calculating the histograms of the encrypted images and the correlation of two adjacent pixels in the plain/encrypted image demonstrating their superior confusion and diffusion property. The obtained results show that SHC-GPM strongly withstands statistical attacks.…”

Hill Cipher Modification based on Pseudo-Random Eigenvalues

“…To prove the robustness of the proposed scheme, the statistical analysis has been performed. It is usually evaluated by the following measures [21,23,27,28,29]; calculating the histograms of the encrypted images and the correlation of two adjacent pixels in the plain/encrypted image demonstrating their superior confusion and diffusion property. The obtained results show that our scheme strongly withstands statistical attacks.…”

A differential cryptanalysis of Yen–Chen–Wu multimedia cryptography system

“…Then, perform the byte swapping operation for the following 32 values of (i, j, l) one after another: (0,8,4), (1,9,5), (2,10,6), (3,11,7), (4,12,8), (5,13,9), (6,14,10), (7,15,11), (0,4,12), (1,5,13), (2,6,14), (3,7,15), (8,12,16), (9,13,17), (10,14,18), (11,15,19), (0,2,20), (1,3,21), (4,6,22), (5,7,23), (8,…”

“…Due to the subtle similarity between chaos and cryptography, some of multimedia encryption schemes were designed based on one or more chaotic systems [3,4,5,8,9,11]. Meanwhile, a lot of cryptanalytic work has also been reported, showing that many encryption schemes were not designed carefully and are prone to various kinds of attacks [12,13,14,15,16,17,18,19,20,21,22,23].…”