Abstract
In this paper, a new and efficient pixel-level image encryption algorithm is presented. In contrast to the traditional permutation–diffusion architecture, the proposed method enhances the connection between position shuffling for pixels and value changing for grayness. As a result, the separate attack becomes more difficult when attacking our structure of permutation–rewriting–diffusion (PRD). Before the diffusion operation, a rewriting function is applied to the permuted image in a simple way, which can be seen as a remedy for permutation’s inability to change the frequency of pixels. Moreover, the keystream is designed dependent upon the plain-image. Therefore, the proposed method can disturb the chosen plain-image and known plain-image attacks. Experimental results together with security analysis also show good efficiency of the PRD mechanism. Compared to some bit-level-based image encryption algorithms, our method shows increased faster speed and satisfies the performance requirements of real-time communication.
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 callDisclaimer: 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.
