Author
Abstract
This paper proposes an innovative approach to enhance the robustness of substitution boxes in cryptography by employing chaotic mapping. Our methodology leverages chaotic mapping to construct a robust 8 × 8 S-box that adheres to the requirements of a bijective function. An illustrative example of such an S-box is presented, accompanied by a comprehensive analysis employing established metrics such as nonlinearity, bijection, bit independence, strict avalanche effect, linear approximation probability, and differential uniformity. To evaluate its strength, we benchmark the performance of our proposed S-box against recently investigated counterparts. Our findings reveal that our approach to S-box construction is both pioneering and efficacious in fortifying substitution boxes for cryptography. Given the escalating frequency of cyber threats and hacking incidents, safeguarding online communication and personal information has become increasingly challenging. Cryptography plays a pivotal role in addressing these challenges by transforming data into a more secure format. In this research, we introduce a novel, lightweight algorithm grounded in trigonometric principles, which significantly enhances security and reducessusceptibility to hacking attempts. Comparative evaluations demonstrate the superior performance of our algorithm over established methods such as the Hill cipher, Blowfish, and DES. While conventional approaches prioritize security, they often incur delays due to increased computational load. Our objective is to expedite cryptographic processes without compromising security, achieved through the strategic application of trigonometric principles. Our algorithm capitalizes on trigonometric functions and operations to introduce confusion, thereby thwarting hacking attempts. Extensive research and testing substantiate that our algorithm excels in both security and speed compared to traditional methods. By seamlessly integrating trigonometric concepts into a streamlined design, our algorithm proves to be practical for real-world applications, offering a robust solution for safeguarding data on the Internet.
Suggested Citation
Download full text from publisher
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:abq:ijist1:v:5:y:2023:i:4:p:730-745. 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: Iqra Nazeer (email available below). General contact details of provider: .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.