Deciphering a novel image cipher based on mixed transformed Logistic maps

Since John von Neumann suggested utilizing Logistic map as a random number generator in 1947, a great number of encryption schemes based on Logistic map and/or its variants have been proposed. This paper re-evaluates the security of an image cipher based on transformed logistic maps and proves that the image cipher can be deciphered efficiently under two different conditions: 1) two pairs of known plain-images and the corresponding cipher-images with computational complexity of $O(2^{18}+L)$; 2) two pairs of chosen plain-images and the corresponding cipher-images with computational complexity of $O(L)$, where $L$ is the number of pixels in the plain-image. In contrast, the required condition in the previous deciphering method is eighty-seven pairs of chosen plain-images and the corresponding cipher-images with computational complexity of $O(2^{7}+L)$. In addition, three other security flaws existing in most Logistic-map-based ciphers are also reported.Comment: 10 pages, 2 figure

Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations

Recently two encryption schemes were proposed by combining circular bit shift and XOR operations, under the control of a pseudorandom bit sequence (PRBS) generated from a chaotic system. This paper studies the security of these two encryption schemes and reports the following findings: 1) there exist some security defects in both schemes; 2) the underlying chaotic PRBS can be reconstructed as an equivalent key by using only two chosen plaintexts; 3) most elements in the underlying chaotic PRBS can be obtained by a differential known-plaintext attack using only two known plaintexts. Experimental results are given to demonstrate the feasibility of the proposed attack.Comment: 17 pages, 8 figure

On Real-valued Visual Cryptographic Basis Matrices

Visual cryptography (VC) encodes an image into noise-like shares, which can be stacked to reveal a reduced quality version of the original. The problem with encrypting colour images is that they must undergo heavy pre-processing to reduce them to binary, entailing significant quality loss. This paper proposes VC that works directly on intermediate grayscale values per colour channel and demonstrates real-valued basis matrices for this purpose. The resulting stacked shares produce a clearer reconstruction than in binary VC, and to the best of the authors’ knowledge, is the first method posing no restrictions on colour values while maintaining the ability to decrypt with human vision. Grayscale and colour images of differing entropies are encrypted using fuzzy OR and XOR, and their PSNR and structural similarities are compared with binary VC to demonstrate improved quality. It is compared with previous research and its advantages highlighted, notably in high quality reconstructions with minimal processing

(N,N) Share Generation using Key Share approach for RGB image in VCS

Visual Cryptography is a secure and unique image encryption technique which protects image based secret. In visual cryptography image is encrypted into shares and in decryption process all or some of shares are super imposed with each other to decrypt the original secret image. In this technique no complex computation is needed for decryption of secret image which is the best advantage of Visual Cryptography Scheme. In this report various types of visual cryptographic techniques are discussed from previous research area. In this proposed system (N, N) VCS is used for encryption. It takes color image as an input and extracts in R, G and B components. After that it generates Key-Mask using Key-Mask generation algorithm which XOR-ed with R, G and B components and gives the key shares. Further XOR operation of these key shares with key mask generates the color shares. In decryption process image is recovered by XOR operation between key mask and color shares. It has a better security features compared to previous one