Abstract
To address the shortcomings of weak confusion and high time complexity of the existing permutation algorithms, including the traditional Josephus ring permutation (TJRP), an improved Josephus ring-based permutation (IJRBP) algorithm is developed. The proposed IJRBP replaces the remove operation used in TJRP with the position exchange operation and employs random permutation steps instead of fixed steps, which can offer a better scrambling effect and a higher permutation efficiency, compared with various scrambling methods. Then, a new encryption algorithm based on the IJRBP and chaotic system is developed. In our scheme, the plaintext feature parameter, which is related to the plaintext and a random sequence generated by a chaotic system, is used as the shift step of the circular shift operation to generate the diffusion matrix, which means that a minor change in the source image will generate a totally different encrypted image. Such a strategy strikes a balance between plaintext sensitivity and ciphertext sensitivity to obtain the ability to resist chosen-plaintext attacks (CPAs) and the high robustness of resisting noise attacks and data loss. Simulation results demonstrate that the proposed image cryptosystem has the advantages of great encryption efficiency and the ability to resist various common attacks.
Highlights
To overcome the weaknesses of existing works, we propose an improved Josephus ring-based permutation (IJRBP) and a new encryption scheme
To verify the security and efficiency of the proposed encryption scheme, some standard images with different sizes are used in multiple simulation and security analyses
A novel, improved Josephus ring-based permutation algorithm is proposed in this paper
Summary
With the development of communication technology, some new transmission media such as image and video are widely used to disseminate information. In 1998, Fridrich proposed a new cryptographic framework that includes permutation and diffusion using a two-dimensional chaotic map Such a method disrupts the position of the pixels, and changes the statistical characteristic of the plaintext image [3]. In [1], a novel cryptosystem is developed based on a circular shift operation in which step size is controlled by the pseudo-random sequence This scheme has excellent encryption efficiency, its scrambling effect needs to be further improved. In [18], Niu et al developed an improved Josephus ring scrambling algorithm with a dynamic step size, related to the pixel value of the plaintext. This scheme greatly improves the scrambling effect and plaintext sensitivity, but possesses poor robustness against noise attacks and a slow encryption speed. Other studies introduced additional perturbations to the chaotic maps to avoid chaos degradation [35] when implementing in hardware with limited precision [36,37]
Sign-in/Register to view highlights & summary 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.
