Author
Listed:
- Rupayan Das
(Institute of Engineering and Management
University of Engineering and Management)
- Angshuman Khan
(University of Engineering and Management)
- Rajeev Arya
(National Institute of Technology Patna)
- Boykuziev Ilkhom
(National University of Uzbekistan
Tashkent University of Information Technologies)
- Abdurakhimov Bakhtiyor
(National University of Uzbekistan)
- Nuriddin Safoyev
(Tashkent University of Information Technologies)
- Zarif Khudoykulov
(Tashkent University of Information Technologies)
Abstract
In recent times, there has been a significant surge in research interest in security, driven by the continuous growth of threats and cyber attacks. Recognizing that existing state-of-the-art security schemes may not adequately address the requirements for lightweight properties and enhanced security measures, the aim of this research is to contribute to the field. The focus is on the development and implementation of lightweight encryption protocols designed to bolster security measures in the face of evolving challenges. The primary objective of this endeavor is to create a secure system utilizing the 3-round Kuznyechik algorithm (SSKA). In this process we introduce key generation algorithm followed by encryption and decryption techniques. The key generation algorithm is mainly based on three-round Kuznyechik algorithm. The Kuznyechik 3-round encryption mechanism has been proven to be effective in producing an imbalanced set at the end of the round and a balanced set before to the third round by employing a set in which the first byte is active and the following bytes are passive. This encourage us to use 3-round Kuznyechik algorithm. Building upon the aforementioned findings, an effective algorithm is suggested for determining the key of the final round in the 3-round Kuznyechik algorithm, employing the integral cryptanalysis method. Based on simulation results, the proposed approach demonstrates noteworthy enhancements in comparison to baseline algorithms concerning time complexity, encryption time, throughput, decryption time, data overhead, and space complexity.
Suggested Citation
Rupayan Das & Angshuman Khan & Rajeev Arya & Boykuziev Ilkhom & Abdurakhimov Bakhtiyor & Nuriddin Safoyev & Zarif Khudoykulov, 2024.
"SSKA: secure symmetric encryption exploiting Kuznyechik algorithm for trustworthy communication,"
International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(6), pages 2391-2400, June.
Handle:
RePEc:spr:ijsaem:v:15:y:2024:i:6:d:10.1007_s13198-024-02253-7
DOI: 10.1007/s13198-024-02253-7
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:spr:ijsaem:v:15:y:2024:i:6:d:10.1007_s13198-024-02253-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.