Breaking an image encryption algorithm based on chaos

Recently, a chaos-based image encryption algorithm called MCKBA (Modified Chaotic-Key Based Algorithm) was proposed. This paper analyzes the security of MCKBA and finds that it can be broken with a differential attack, which requires only four chosen plain-images. Performance of the attack is verified by experimental results. In addition, some defects of MCKBA, including insensitivity with respect to changes of plain-image/secret key, are reported.Comment: 10 pages, 4 figure

Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks

Recently, an image scrambling encryption algorithm of pixel bit based on chaos map was proposed. Considering the algorithm as a typical binary image scrambling/permutation algorithm exerting on plaintext of size $M\times (8N)$, this paper proposes a novel optimal method to break it with some known/chosen-plaintexts. The spatial complexity and computational complexity of the attack are only $O(32\cdot MN)$ and $O(16\cdot n_0\cdot MN)$ respectively, where $n_0$ is the number of known/chosen-plaintexts used. The method can be easily extended to break any permutation-only encryption scheme exerting on plaintext of size $M\times N$ and with $L$ different levels of values. The corresponding spatial complexity and computational complexity are only $O(MN)$ and $O(\lceil\log_L(MN)\rceil \cdot MN)$ respectively. In addition, some specific remarks on the performance of the image scrambling encryption algorithm are presented.Comment: 11 pages, 6 figure

A Novel Diffusion-Permutation Image Encryption Scheme Based on Spatiotemporal Chaos

The spatiotemporal chaos possesses better properties than simple chaotic system, which has attracted more and more attention by the researchers in the image encryption field. This paper presents a novel image encryption scheme based on spatiotemporal chaos. The algorithm uses the spatiotemporal chaos to diffuse plain image and an Arnold map shuffle the positions of pixels. Test results and security analysis not only show that the scheme is characteristic of excellent sensitivity to the original image and keys, large secret key space and high expansibility, but also has excellent effective encryption and strong anti-attacking performance

An Image Encryption Algorithm Based on Balanced Pixel and Chaotic Map

Image encryption technology has been applied in many fields and is becoming the main way of protecting the image information security. There are also many ways of image encryption. However, the existing encryption algorithms, in order to obtain a better effect of encryption, always need encrypting several times. There is not an effective method to decide the number of encryption times, generally determined by the human eyes. The paper proposes an image encryption algorithm based on chaos and simultaneously proposes a balanced pixel algorithm to determine the times of image encryption. Many simulation experiments have been done including encryption effect and security analysis. Experimental results show that the proposed method is feasible and effective

IMPLEMENTASI ALGORITMA ENKRIPSI CITRA DIGITAL BERBASIS CHAOS MENGGUNAKAN FUNGSI KOMPOSISI LOGISTIC DAN GAUSS ITERATED MAP

Computer and information technology is very fast as technology develops. People can easily use the internet as a media for searching, sending and receiving information. Information can be in the form of text, image, audio, video, and multimedia, information can be quickly spread throughout the world through the internet. To increase the durability of the algorithm used in the encryption process from brute force attacks, one of them is by implementing chaos theory. The aim of the study was to create a digital image encryption algorithm based on chaos function. The chaos function used is the result of the composition of the Logistic Map function and the Gauss Map function. The chaos function will be used to generate a key stream that will be used to substitute the original image pixel into an encrypted image with XOR operations. The simulation results show that the key sensitivity of this algorithm is that up to 10-16 and the key space is the key is 1.8 x 1079. The NIST test was performed and proved that the resulting key stream was random, and from the histogram test the pixel value of the uniform encryption image. This shows that the digital image encryption algorithm with the Log-gauss Map function is resistant to brute force and statistical attacks. PSNR test results for all original images with the results of the description of the same pixel values . Keywords: Enkripsi, Chaos, Citra digital, Kriptografi, Log-gauss Map, Logistic Map, Gauss Iterated Ma

Security Analysis of Multimedia Data Encryption Technique Using Piecewise Linear Chaotic Maps

In the current age of globalization file sharing has become an important part of every business process. Also in recent years, transfer of image or multimedia content across the world has become increasingly popular. To prov ide security, to large amount of multimedia content, a strong cryptographic technique is required, which can secure the multimedia content at desired transmission rate. Unfortunately, none of the traditional cryptographic algorithms provide enough security at required transmission rate. But chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure multimedia or image encryption techniques. T his paper aims to analyze the security of "Multimedia Data Encryption Algorithm", on different kind of multimedia images and further to propose a new encryption technique for multimedia data