Abstract
This article introduces a novel one-dimensional sine chaotic system (1DSCS) with large parameter interval. The evaluation of 1DSCS indicates that the system has good chaotic characteristics and large parameters space. Based on 1DSCS, a new image encryption scheme is proposed. First, the image is scrambled by the row and column indexes, and then scrambled by the dynamic parameters Arnold map. This scheme avoids the inadequacy of row-column index scrambling and the periodicity of Arnold map. Second, four highly sensitive dynamic diffusion formulas related to plaintext are designed, and the dynamic formulas are selected through the chaotic sequence generated by 1DSCS. Third, the scheme proposed in this article can also be applied to color image encryption. The experimental results demonstrate that the 1DSCS system is suitable for image encryption and the encryption scheme has good security to resist common attacks.
Highlights
The era of big data has come, and the transmission rate of information and communication has developed rapidly
We apply 1DSCS to generate chaotic sequence and propose a new image encryption scheme based on 1DSCS
We proposed a remainder selection diffusion method, which selects the dynamic diffusion formula by taking the residual of the chaotic sequence generated
Summary
The era of big data has come, and the transmission rate of information and communication has developed rapidly. The chaotic sequence generated by the chaotic system has ergodicity, non-convergence and pseudo-randomness These characteristics can effectively improve the information security of image encryption system [8], [9]. Many image encryption algorithms based on chaotic system have been proposed [10], [11]. One-dimensional chaotic system has the defects of short period, small parameter ranges and unequal distribution of chaotic sequence To solve those problems, some scholars proposed new onedimensional chaotic systems. We apply 1DSCS to generate chaotic sequence and propose a new image encryption scheme based on 1DSCS. In order to solve these problems, a scrambling algorithm is proposed in this article This algorithm makes Arnold parameters dynamic and combines Arnold map with row-column index scrambling.
Sign-in/Register to view highlights & summary 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.
