Ch Muhammad Afaq Aslam , Ikram Ullah , Muhammad Ishaq
{"title":"An optimal and efficient framework for the construction of nonlinear components based on a polynomial ring","authors":"Ch Muhammad Afaq Aslam , Ikram Ullah , Muhammad Ishaq","doi":"10.1016/j.matcom.2025.04.022","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"237 ","pages":"Pages 263-280"},"PeriodicalIF":4.4000,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics and Computers in Simulation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378475425001521","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
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.
期刊介绍:
The aim of the journal is to provide an international forum for the dissemination of up-to-date information in the fields of the mathematics and computers, in particular (but not exclusively) as they apply to the dynamics of systems, their simulation and scientific computation in general. Published material ranges from short, concise research papers to more general tutorial articles.
Mathematics and Computers in Simulation, published monthly, is the official organ of IMACS, the International Association for Mathematics and Computers in Simulation (Formerly AICA). This Association, founded in 1955 and legally incorporated in 1956 is a member of FIACC (the Five International Associations Coordinating Committee), together with IFIP, IFAV, IFORS and IMEKO.
Topics covered by the journal include mathematical tools in:
•The foundations of systems modelling
•Numerical analysis and the development of algorithms for simulation
They also include considerations about computer hardware for simulation and about special software and compilers.
The journal also publishes articles concerned with specific applications of modelling and simulation in science and engineering, with relevant applied mathematics, the general philosophy of systems simulation, and their impact on disciplinary and interdisciplinary research.
The journal includes a Book Review section -- and a "News on IMACS" section that contains a Calendar of future Conferences/Events and other information about the Association.