Author
Listed:
- Aslam, Ch Muhammad Afaq
- Ullah, Ikram
- Ishaq, Muhammad
Abstract
The widespread use of internet makes it essential to protect the private data from the intruders via developing highly secure cryptographic systems. The Substitution box (s-box) is the only nonlinear component of any security system. It plays a crucial role in securing data from an unauthorized access by inverting it into an unreadable form. The algebraic structures are mostly utilized to develop two types of s-box generators, namely the randomized and the optimal generators. The one type outputs dynamic, while the other one is responsible to design s-boxes with high cryptographic properties. However, the generator which gives highly dynamic and optimal s-boxes needs high computational overhead, which limits the encryption throughput of a large useful data set. This fact implies the need of developing an s-box generator that is capable to construct an s-box with high cryptographic properties at a low computational cost. This study presents an innovative algebraic method for constructing optimal s-boxes using a finite field and a polynomial ring. Our approach offers flexibility in selecting unconstrained primes and polynomials, allowing the generation of highly dynamic and nonlinear s-boxes. By evaluating polynomials over a finite field and introducing a new total ordering, we effectively diffuse input elements and derive optimal s-boxes with a nonlinearity of 112. We determine the total number of s-boxes based on the proposed scheme. The performance of the proposed s-box is assessed using standard metrics. We compare the attained results with that of the s-boxes constructed by the recent and state of the art algorithms. Apart from this, we compare the proposed s-box generator with an efficient one regarding the execution time and other cryptographic properties. We showed that the proposed scheme attains the highly nonlinear component approximately 5 times faster than the existing one, and the experimental results indicate that the current method outperforms than others across the standard cryptographic metrics.
Suggested Citation
Aslam, Ch Muhammad Afaq & Ullah, Ikram & Ishaq, Muhammad, 2025.
"An optimal and efficient framework for the construction of nonlinear components based on a polynomial ring,"
Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 237(C), pages 263-280.
Handle:
RePEc:eee:matcom:v:237:y:2025:i:c:p:263-280
DOI: 10.1016/j.matcom.2025.04.022
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
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:eee:matcom:v:237:y:2025:i:c:p:263-280. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.