Abstract

This paper proposed a secure and fast image encryption algorithm which is composed of permutation and substitution of pixels. In order to eliminate the relation between adjacent pixels in the image sufficiently, firstly, the sequence which derives from Logistic map is sorted as an ascending order, and the transformation function of element's index can be obtained in this process. Secondly, perform XOR operation between the scrambled pixel sequence and another chaotic sequence which derives from Henon map. Experiment simulations show that the proposed algorithm is secure against different types of attacks and can be applied to the real time encryption.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.