Aiming at the problems of limited parameter range of traditional one-dimensional mapping, narrow chaotic range, and insufficient complexity, this paper proposes a compound mapping based on R-order Chebyshev. The Lyapunov exponent, uniformity and complexity analysis of the R-order compound Chebyshev map are performed, and the NIST randomness test is performed on it to verify its good randomness. The R-order Chebyshev composite map is applied to the scrambling and diffusion stages of the image encryption system. Through comparative research with other encryption algorithms, the image encryption algorithm proposed in this paper has high security and can effectively resist common attacks
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.