arrow
Return

Elevating Network Security: A Novel S-Box Algorithm for Robust Data Encryption

delete2024-01-01
delete3
delete
OA
AI
J
Jarallah Alqahtani
M
Muhammad Akram
G
Ghassan Ahmed Alı
N
Nadeem Iqbal *
A
Ali Alqahtani
R
Roobaea Alroobaea
DOI:10.1109/ACCESS.2023.3348144delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In an era characterized by ever-increasing data exchange across different networks, the importance of robust network security measures cannot be overemphasized. Cryptographic algorithms, on the other hand, perform a vital role in imparting security to the sensitive information during transmission, with S-Boxes (Substitution Boxes) serving as a fundamental component of symmetric-key ciphers. This study has endeavored to engineer a novel S-Box algorithm to bolster the network security. Moreover, the core focus of the suggested algorithm lies in enhancing the confidentiality, defiance to nefarious designs of cryptanalysis savvy, and overall cryptographic strength of data encryption in network communication. Random numbers spawned by the 5D multi-wing hyperchaotic system have been employed to design the proposed box. Apart from that, Rook -a chess piece has been used in this regard. Particularly, the random walk of Rook on the 16 x 16 hypothetical chessboard has been capitalized to sufficiently permute the data of the potential S-Box. Through a comprehensive performance evaluation and cryptographic analyses, the proposed S-Box algorithm exhibits superior resilience against diverse threats thus fortifying network security effectively. In particular, the state of the art security parameters like bijectivity, non-linearity (NL), strict-avalanche criterion (SAC), bit-independence criterion (BIC), linear probability (LP) and differential probability (DP) have been used. This work, no doubt, contributes significantly to the ever-evolving field of network security.
Keywords:
Encryption
Network security
Ciphers
Computer science
Heuristic algorithms
Three-dimensional displays
chaos
random numbers
S-Box
Rook
chess

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

U
University of Lahore
Scholars:
3.4K
Papers: 2.8K
Citations: 13
Sultan Sharif Ali Islamic University cover
Sultan Sharif Ali Islamic University
Scholars:
53
Papers: 48
Citations: 20
N
Najran University
Scholars:
2.4K
Papers: 2.7K
Citations: 3.3K
T
Taif University
Scholars:
5.9K
Papers: 7.0K
Citations: 7.5K
researcher View more organizations
Cited Papers

Cited Papers

DNA and Plaintext Dependent Chaotic Visual Selective Image Encryption
err2020-01-01
err69
errOAAI
errKhan, Jan Sher; Boulila, Wadii; Ahmad, Jawad; Rubaiee, Saeed; Rehman, Atique Ur; Alroobaea, Roobaea; Buchanan, William J.
errShare
errSave
Efficient hydrophilicity improvement of titanium surface by plasma jet in micro-hollow cathode discharge geometry
err2023-07-01
err0
PREAI
errPeng-Ying Jia; Han-Xiao Jia; Jun-Xia Ran; Kai-Yue Wu; Jia-Cun Wu; Xue-Xia Pang; Xue-Chen Li
errShare
errSave
Block Cipher Nonlinear Confusion Components Based on New 5-D Hyperchaotic System
err2021-01-01
err19
errOAAI
errAlhudhaif, Adi; Ahmad, Musheer; Alkhayyat, Ahmed; Tsafack, Nestor; Farhan, Alaa Kadhim; Ahmed, Rafeeq
errShare
errSave
ICF Core Set for patients with neurological conditions in early post-acute rehabilitation facilities
err2009-07-07
err0
PREAI
errMarita Stier-Jarmer; Eva Grill; Thomas Ewert; Sabine Bartholomeyczik; Monka Finger; Thomas Mokrusch; Nenad Kostanjsek; Gerold Stucki
errShare
errSave
A Scalable Strand-Specific Protocol Enabling Full-Length Total RNA Sequencing From Single Cells
err2021-06-03
err0
errOAAI
errSimon Haile; Richard D. Corbett; Veronique G. LeBlanc; Lisa Wei; Stephen Pleasance; Steve Bilobram; Ka Ming Nip; Kirstin Brown; Eva Trinh; Jillian Smith; Diane L. Trinh; Miruna Bala; Eric Chuah; Robin J. N. Coope; Richard A. Moore; Andrew J. Mungall; Karen L. Mungall; Yongjun Zhao; Martin Hirst; Samuel Aparicio; Inanc Birol; Steven J. M. Jones; Marco A. Marra
errShare
errSave
researcher View more