Abstract

In traditional chaotic map based image encryption algorithm, the encryption performance is determined by the permutation generating speed, and due to short periodical problem led by the finite precision effect, the permutation generating is always in a low efficient. In this paper, a method to generate a large permutation by combining several small permutation arrays is proposed by introducing a join operation to improve the permutation generating speed, where small permutation arrays are generated by one-dimensional chaotic map. Based on this permutation generating, an image encryption algorithm is proposed where XOR and MOD based diffusion procedures are added. The complete image encryption algorithm is a multiple rounds of substitution-permutation network where permutation and diffusion as the basic building blocks. Experiments show that the proposed algorithm is a key-sensitive, can resist different attacks such as differential attack and plaintext attack, and the ciphered image is similar to a noise image.

Full Text
Paper version not known

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.