We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A novel S-box generator using Frobenius automorphism and its applications in image encryption.
- Authors
Ali, Rashad; Ali, Javed; Ping, Ping; Jamil, Muhammad Kamran
- Abstract
The goal of cryptography is to provide algorithms that safeguard sensitive information sent via unprotected networks. These methods encrypt the information, making it unintelligible even if adversaries manage to get it. The substitution box (S-box) structure is the most significant and nonlinear component of the Advanced Encryption Standard (AES) algorithm. In the algorithm, the S-box supplies the confusion or mixing process. A highly non-linearity-valued S-box significantly boosts defenses against a range of threats. Unfortunately, the achievable encryption throughput is constrained by the computationally costly nature of creating S-boxes. This emphasizes the necessity of creating new S-box generators with the best strength and minimum computing requirements to provide optimal security. We presented an efficient approach that uses the composition of Frobenius automorphism and Mobius transformation of G F (2 8) . In this way, we got two highly nonlinear permutations that can produce millions of S-boxes with very strong cryptographic strength. The dynamic behavior of the proposed generator is analyzed by clarifying the requirements for generating distinct S-boxes and ensuring that the produced S-boxes have a uniform probability distribution. Our generator can produce S-boxes with robust cryptographic features, according to a thorough security study. Our novel generation method for building S-boxes efficiently combines the benefits of both algebraic modeling and chaotic mapping, providing a solid basis for building robust S-boxes. Our approach can guarantee that the produced S-boxes have strong variety and outstanding comprehensive performance by using the ergodicity of the chaotic system. Additionally, the experimental findings presented in this study validate that the dynamic S-boxes generated by our technique not only satisfy the criteria for creating encryption methods but also provide enhanced security for picture encryption. Furthermore, our approach generates S-boxes with good efficiency. Our technique has a wide range of possible applications in cryptography, including the creation of dynamic S-boxes for encryption algorithms and high-performance S-boxes for image security. In light of current security risks and computing demands, our theoretical and computational evaluations indicate that our S-box generator is a good contender for real-world applications.
- Subjects
ADVANCED Encryption Standard; DISTRIBUTION (Probability theory); FINITE fields; PERMUTATIONS; ALGORITHMS; CRYPTOGRAPHY
- Publication
Nonlinear Dynamics, 2024, Vol 112, Issue 21, p19463
- ISSN
0924-090X
- Publication type
Article
- DOI
10.1007/s11071-024-10003-4