Author
Listed:
- Nayeem Ahmad Khan
- Abdulbasid Banga
- Taher M Ghazal
- Bayan Alabdullah
- Nadeem Iqbal
- Ahmad Alshamayleh
- Atif Ikram
- Hossam Diab
Abstract
A close study about the varied anatomies of the S-Box algorithms published in the literature indicates that no attempt has been made using the notion of 3D. To cement the more cryptographic security, this research article ventures to present a novel S-Box algorithm exploiting the notion of 3D. First of all, the algorithm initializes a 3D scrambled S-Box with the value of -1. After that, a 1D array is initialized with all the numbers of the potential S-Box. Now, the values placed in the 1D array are inserted randomly to the different cells of the 3D scrambled S-Box until all the numbers from the 1D array are not shifted. The way, the S-Box has been developed bears an ample promise to raise the inherent non-linearity of the required S-Box which, in turn, equips the S-Box to defy the potential cryptanalytic threats from the hackers and other adversaries. Lorenz chaotic system has been employed to produce streams of random numbers. Through rigorous analysis and experimentation, we demonstrate the efficacy of our approach in enhancing cryptographic security, offering robust protection against various cyber threats. Our research contributes to the advancement of S-Box design methodologies, providing a promising avenue for strengthening encryption algorithms in contemporary cryptographic systems. Potential real-world applications include secure communications in IoT devices, encryption in smart grid infrastructures, and data protection in medical imaging systems.
Suggested Citation
Nayeem Ahmad Khan & Abdulbasid Banga & Taher M Ghazal & Bayan Alabdullah & Nadeem Iqbal & Ahmad Alshamayleh & Atif Ikram & Hossam Diab, 2025.
"Unveiling a novel S-Box strategy: The dynamic 3D scrambling approach,"
PLOS ONE, Public Library of Science, vol. 20(9), pages 1-22, September.
Handle:
RePEc:plo:pone00:0329024
DOI: 10.1371/journal.pone.0329024
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0329024. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.