z-logo
open-access-imgOpen Access
Highly dispersive substitution box (S‐box) design using chaos
Author(s) -
Bin Faheem Zaid,
Ali Asim,
Khan Muhamad Asif,
UlHaq Muhammad Ehatisham,
Ahmad Waqar
Publication year - 2020
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.2019-0138
Subject(s) - s box , encryption , cryptosystem , cryptanalysis , black box , algorithm , cryptography , chaotic , nonlinear system , computer science , differential cryptanalysis , benchmark (surveying) , mathematics , theoretical computer science , block cipher , artificial intelligence , physics , geodesy , quantum mechanics , geography , operating system
Highly dispersive S‐boxes are desirable in cryptosystems as nonlinear confusion sub‐layers for resisting modern attacks. For a near optimal cryptosystem resistant to modern cryptanalysis, a highly nonlinear and low differential probability (DP) value is required. We propose a method based on a piecewise linear chaotic map (PWLCM) with optimization conditions. Thus, the linear propagation of information in a cryptosystem appearing as a high DP during differential cryptanalysis of an S‐box is minimized. While mapping from the chaotic trajectory to integer domain, a randomness test is performed that justifies the nonlinear behavior of the highly dispersive and nonlinear chaotic S‐box. The proposed scheme is vetted using well‐established cryptographic performance criteria. The proposed S‐box meets the cryptographic performance criteria and further minimizes the differential propagation justified by the low DP value. The suitability of the proposed S‐box is also tested using an image encryption algorithm. Results show that the proposed S‐box as a confusion component entails a high level of security and improves resistance against all known attacks.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here