Cryptanalysis Of A Kind Of Chaotic Image Encryption Algorithm

More and more information are relying on the network communication in the age of the rapid development an Internet. Security of electronic information has increasing prominent. As we all know, encrypted is a guarantee secure and universal means of research focus. Chaos theory have strong sensitivity to initial conditions, ergodicity, and other characteristics, Which can be considered analogous to some ideal cryptographic properties such as diffusion resistance, confusion and other correspondence. A large number of images is needing network encryption and transmission, but, the original text data encryption algorithm can't meet the demand for rapid development of image encryption. So promote chaotic cipher cryptanalysis algorithm design work is indispensable. In recent years researchers have proposed thousands of chaos encryption algorithm. In this paper, a few chaotic image encryption algorithms is analyzed and categorized. The main achievements of the thesis are as follows:1) Using all "1" position to remove “The Position matrix”, then traverse the k value or select a special matrix the two methods which can retrieve the equivalent secret key for analysis “The choice pixel of interest Chaotic Encryption Algorithm” which is proposed by Gaurav Bhatnagar. In this paper the algorithm is described in detail by the line and realize, with the validity of theoretical analysis and experimental results show the attack, and proposed improvements based on defects of the algorithm.2) An image encryption algorithm based on scrambling and Vegin`ere cipher has been proposed. However, it was soon cryptanalyzed by Zhang et al. We present an improved chosen-plaintext attack to further reduce the number of chosen-plaintexts required, which is proved to be optimal, moreover, it is found that an elaborately designed known-plaintext attack which is conclude SDM, can efficiently compromise the image cipher under study. This finding is confirmed by both mathematical.3) Under the premise newer concept of DNA sequence operation, based on the "Divide and Conquers" strategy to crack each step adding portion and replacement parts.4) Finally, summarize, analysis these three using chaotic pseudo-random sequence, XOR, addition and subtraction, multiplication and division, mold with the plaintext sequence were obtained in cipher text algorithm. In this type of chaotic encryption algorithm, pure position permutation algorithms may be employed in this paper SDM matrix analysis. We classify this type of algorithm, using the idea of divide and rule, and gradually break with plaintext subtractions, XOR, chaotic pseudo-random sequence and position matrix multiplication and division.