Highly dispersive substitution box (S‐box) design using chaos
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 piece...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Electronics and Telecommunications Research Institute (ETRI)
2020-03-01
|
| Series: | ETRI Journal |
| Subjects: | |
| Online Access: | https://doi.org/10.4218/etrij.2019-0138 |
| _version_ | 1819051661089308672 |
|---|---|
| author | Zaid Bin Faheem Asim Ali Muhamad Asif Khan Muhammad Ehatisham Ul‐Haq Waqar Ahmad |
| author_facet | Zaid Bin Faheem Asim Ali Muhamad Asif Khan Muhammad Ehatisham Ul‐Haq Waqar Ahmad |
| author_sort | Zaid Bin Faheem |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-21T12:07:29Z |
| format | Article |
| id | doaj.art-b0b2b66bc4e04862810c9ad13e0ad81d |
| institution | Directory Open Access Journal |
| issn | 1225-6463 |
| language | English |
| last_indexed | 2024-12-21T12:07:29Z |
| publishDate | 2020-03-01 |
| publisher | Electronics and Telecommunications Research Institute (ETRI) |
| record_format | Article |
| series | ETRI Journal |
| spelling | doaj.art-b0b2b66bc4e04862810c9ad13e0ad81d2022-12-21T19:04:41ZengElectronics and Telecommunications Research Institute (ETRI)ETRI Journal1225-64632020-03-0142461963210.4218/etrij.2019-013810.4218/etrij.2019-0138Highly dispersive substitution box (S‐box) design using chaosZaid Bin FaheemAsim AliMuhamad Asif KhanMuhammad Ehatisham Ul‐HaqWaqar AhmadHighly 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.https://doi.org/10.4218/etrij.2019-0138bit independence criteriondifferential approximation probabilitypiecewise linear chaotic mapstrict avalanche criterionsubstitution box |
| spellingShingle | Zaid Bin Faheem Asim Ali Muhamad Asif Khan Muhammad Ehatisham Ul‐Haq Waqar Ahmad Highly dispersive substitution box (S‐box) design using chaos ETRI Journal bit independence criterion differential approximation probability piecewise linear chaotic map strict avalanche criterion substitution box |
| title | Highly dispersive substitution box (S‐box) design using chaos |
| title_full | Highly dispersive substitution box (S‐box) design using chaos |
| title_fullStr | Highly dispersive substitution box (S‐box) design using chaos |
| title_full_unstemmed | Highly dispersive substitution box (S‐box) design using chaos |
| title_short | Highly dispersive substitution box (S‐box) design using chaos |
| title_sort | highly dispersive substitution box s box design using chaos |
| topic | bit independence criterion differential approximation probability piecewise linear chaotic map strict avalanche criterion substitution box |
| url | https://doi.org/10.4218/etrij.2019-0138 |
| work_keys_str_mv | AT zaidbinfaheem highlydispersivesubstitutionboxsboxdesignusingchaos AT asimali highlydispersivesubstitutionboxsboxdesignusingchaos AT muhamadasifkhan highlydispersivesubstitutionboxsboxdesignusingchaos AT muhammadehatishamulhaq highlydispersivesubstitutionboxsboxdesignusingchaos AT waqarahmad highlydispersivesubstitutionboxsboxdesignusingchaos |