Abstract
Abstract Image encryption is crucial for web-based data storage and transmission. Complex algebraic structures play a vital role in providing unique features and binary operations. However, current algebraic-based techniques face challenges due to limited key space. To tackle this issue, our study uniquely connects the algebraic structures with a chaotic map. The study introduces a complex non-chain Galois ring structure and a 12-bit substitution box for image substitution. An affine map is utilized to permute image pixels, and the 12-bit substitution box is uniquely mapped to a Galois field for encryption. A two-dimensional Henon map is employed to generate different keys for the XOR operation, resulting in an encrypted image. The resilience of the scheme against various attacks is evaluated using statistical, differential, and quality measures, showcasing its effectiveness against well-known attacks.
Published Version
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.
