Abstract
Image encryption is sensitive to various attacks due to the high volume of the data and similarity of the pixels in different images. Therefore, the encryption algorithms should have high complexity so that analyses become difficult or even impossible. Also it should have lower time order to quickly encrypt high-volume pictures. This paper presents a new method with a simple algorithm, low time order and high level of output complexity. Three nonlinear chaotic sequences which are known as three-dimensional logistic maps are used for image encryption. These three random sequences are extracted and used for pixels rows and columns permutations. Finally, the pixels are changed column by column with third chaotic sequence using XOR operator. This method is compared with well-known algorithms. The results show that the correlation coefficient is improved on average by 0.0028, NPCR and UACI values by 0.09972.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
