Abstract
The World Wide Web is experiencing a daily increase in data transmission because of developments in multimedia technologies. Consequently, each user should prioritize preventing illegal access of this data by encrypting it before moving it over the Internet. Numerous color image encryption schemes have been developed to protect data security and privacy, indifferent to the computation cost. However, most of these schemes have high computational complexities. This research proposes a fast color image scrambling and encryption algorithm depending on different chaotic map types and an S-box that relies on a hyperchaotic map principle. The first step involves converting color image values from decimal representation to binary representation in the scrambling stage by changing the location of the bits according to a proposed swapping algorithm. Next, in the second scrambling stage, the same process occurs after returning color image values from binary representation to decimal representation and generating an S-box with the assistance of two types of chaotic map, namely, a 2D Zaslavsky map and a 3D Hénon map. Thus, this S-box is relied upon to swap the locations of the pixels in the color image. The encryption procedure begins with the production of three key matrices using a hybrid technique that employs two low-complexity types of chaotic map, namely, a 1D Logistic map and a 3D Hénon map, followed by an XORed as a lightweight process between each key generated for the three matrices and the corresponding red, green, and blue image channels. According to the findings, the proposed scheme demonstrates the most efficiency in terms of lowering the computational cost and shows its effectiveness against a wide range of cryptographic attacks.
Highlights
R ECENT years have seen numerous advancements within computer networks and information technology related to multimedia technologies
Research has focused on separate permutation and diffusion methods, the findings have indicated that they pose a significant risk since they make it easier for attackers to crack the two processes independently
This paper offers a simple color image encryption scheme with excellent security and low complexity to solve the computational cost concerns that exist in the literature
Summary
R ECENT years have seen numerous advancements within computer networks and information technology related to multimedia technologies. Researchers has suggested several approaches to secure image information, including data hiding, encryption and watermarking. In the block cipher structure architecture, the S-box is a crucial nonlinear module that confuses the relationship between ciphertext and secret keys [28]. In these cryptographic systems, the security is principally affected by the characteristics of the employed S-boxes. The security is principally affected by the characteristics of the employed S-boxes It must satisfy the following criteria: bijection, nonlinearity, output Bit Independence Criterion (BIC) and the Strict Avalanche Criterion (SAC). In order to build cryptographically secured dynamic S-boxes, cryptography researchers have been interested in this topic [29]
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.
