Publication:
Enhancement of non-permutation binomial power functions to construct cryptographically strong S-Boxes

Simple item page
cris.virtual.department Universiti Malaysia Perlis
cris.virtual.department Universiti Malaysia Perlis
cris.virtual.department Universiti Malaysia Perlis
cris.virtualsource.department cceb5fbd-9dd3-451a-97a3-0d814cc171a7
cris.virtualsource.department 60039a4a-8bb2-4b81-a4ac-c7e8edd977f9
cris.virtualsource.department 2141a6e7-6f89-45e5-8f17-98f1cd342a13
dc.contributor.author Herman Isa
dc.contributor.author Syed Alwee Aljunid Syed Junid
dc.contributor.author Muhammad Reza Z’aba
dc.contributor.author Rosdisham Endut
dc.contributor.author Syed Mohammad Ammar
dc.contributor.author Norshamsuri Ali @ Hasim
dc.date.accessioned 2024-06-28T13:57:07Z
dc.date.available 2024-06-28T13:57:07Z
dc.date.issued 2023
dc.description.abstract A Substitution box (S-box) is an important component used in symmetric key cryptosystems to satisfy Shannon’s property on confusion. As the only nonlinear operation, the S-box must be cryptographically strong to thwart any cryptanalysis tools on cryptosystems. Generally, the S-boxes can be constructed using any of the following approaches: the random search approach, heuristic/evolutionary approach or mathematical approach. However, the current S-box construction has some drawbacks, such as low cryptographic properties for the random search approach and the fact that it is hard to develop mathematical functions that can be used to construct a cryptographically strong S-box. In this paper, we explore the non-permutation function that was generated from the binomial operation of the power function to construct a cryptographically strong S-box. By adopting the method called the Redundancy Removal Algorithm, we propose some enhancement in the algorithm such that the desired result can be obtained. The analytical results of our experiment indicate that all criteria such as bijective, nonlinearity, differential uniformity, algebraic degree and linear approximation are found to hold in the obtained S-boxes. Our proposed S-box also surpassed several bijective S-boxes available in the literature in terms of cryptographic properties.
dc.identifier.doi 10.3390/math11020446
dc.identifier.uri https://www.mdpi.com/2227-7390/11/2/446/html
dc.identifier.uri https://hdl.handle.net/20.500.14170/3166
dc.language.iso en
dc.relation.ispartof Mathematics
dc.relation.issn 2227-7390
dc.subject S-box
dc.subject Cryptographically strong s-box
dc.subject Binomial power function
dc.subject Non-permutation function
dc.subject Redundancy removal algorithm
dc.title Enhancement of non-permutation binomial power functions to construct cryptographically strong S-Boxes
dc.type journal-article
dspace.entity.type Publication
oaire.citation.endPage 22
oaire.citation.issue 2
oaire.citation.startPage 1
oaire.citation.volume 11
oairecerif.author.affiliation Universiti Malaysia Perlis
oairecerif.author.affiliation Universiti Malaysia Perlis
oairecerif.author.affiliation MIMOS Berhad
oairecerif.author.affiliation Universiti Malaysia Perlis
oairecerif.author.affiliation Universiti Malaysia Perlis
oairecerif.author.affiliation Universiti Malaysia Perlis
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Enhancement of Non-Permutation Binomial Power Functions to Construct Cryptographically Strong S-Boxes.pdf
Size:
513.68 KB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
Enhancement of Non-Permutation Binomial Power Functions to Construct Cryptographically Strong S-Boxes.pdf
Size:
84.37 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Journal Articles