An optimal and efficient framework for the construction of nonlinear components based on a polynomial ring

Ch Muhammad Afaq Aslam, Ikram Ullah and Muhammad Ishaq

Mathematics and Computers in Simulation (MATCOM), 2025, vol. 237, issue C, 263-280

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.

Keywords: Finite field; Polynomial ring; Polynomial; Order; Substitution box (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475425001521
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:237:y:2025:i:c:p:263-280

DOI: 10.1016/j.matcom.2025.04.022

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().