Encryption algorithm of multiple image using two dimensional chaotic
A huge number of images are produced in a lot of fields, such as weather forecasting, military, engineering, medicine, science and personal affairs. So, with the quick improvement of computer devices and Internet, media security turns into a challenge both for industry and the academic research. The image transmission security is our target. Many authors have proposed a lot of single image encryption algorithms to solve this problem Single image encryption algorithms contain algorithm using chaotic economic map algorithm using a chaotic system algorithm via one time pads a chaotic approach algorithm via pixel shuffling and random key stream algorithm using chaotic maps and DNA encoding and algorithm using total chaotic shuffling scheme In Elsheh and Hamza's work the authors proposed two secret sharing approaches for 3D models using Blakely and Thien and Lin schemes. Those approaches reduce share sizes and remove redundancies and patterns that may ease image encryption. The authors in Reference conclude that the dynamic rounds chaotic block cipher can guarantee the security of information transmission and realize the lightweight of the cryptographic algorithm. The single image can encrypt multiple images repeatedly but the efficiency of that encryption is always unfavorable. Researchers increased their attention towards multiple image encryption because the high efficiency of secret information transmission is required for the modern multimedia security technology. They have presented many multiple image algorithms. The authors of presented multiple image algorithm via mixed image element and chaos. A multiple image algorithm using pixel exchanged operation and vector decomposition is proposed in In the authors presented an algorithm using mixed permutation and image element. The authors presented multiple image encryption via computational ghost imaging in In the authors proposed an algorithm using optical asymmetric key cryptosystem. Multiple image encryption algorithm based on spectral cropping and spatial multiplexing is presented in The authors of proposed multiple image encryption algorithm based on lifting wavelet transformed and XOR operation based on compressive ghost imaging scheme. With these large number of proposed algorithms, some practical problems are still existing. For instance, some multiple image algorithms faced the problem that original images can not be recovery completely Those algorithms are used to encrypt multiple images, but the corresponding original images are not recovered completely. This leads to lossy algorithms which are not appropriate for those applications needing images with high visible quality. Another problem, the complex computations of some algorithms affect the encryption efficiency So, good techniques are required for solving these problems In the current paper, a new efficient multiple image encryption algorithm using MIES and two dimensional chaotic economic map is proposed. The advantages of that algorithm are recovering plain images completely and Simplifying the computations. Experimental results demonstrate its practicality and high proficiency. To enhance the encryption proficiency and encourage the protected multiple images transmission, the current work introduces an encryption algorithm of multiple image using the combination of mixed image elements (MIES) and two dimensional economic map. Firstly, original images are grouped in one big image, that splits into a lot of pure image elements (PIES) secondly, logistic map is used to shuffle the PIES; thirdly, it is confused with the sequence produced by the two dimensional economic map to get MIES; finally, the MIES is gathered into a big encrypted image, that splits into a lot of images with the same size of the original images. The proposed algorithm includes huge number key size space and this makes the algorithm save from hackers. Even more the encryption results obtained by the proposed algorithm outperforms existing algorithms in literature. A comparison between proposed algorithm and similar algorithms is made. The analysis of the experimental results and the proposed algorithm shows that the proposed algorithm is efficient and secure.