SSKA: secure symmetric encryption exploiting Kuznyechik algorithm for trustworthy communication

Rupayan Das, Angshuman Khan, Rajeev Arya (), Boykuziev Ilkhom, Abdurakhimov Bakhtiyor, Nuriddin Safoyev and Zarif Khudoykulov
Additional contact information
Rupayan Das: Institute of Engineering and Management
Angshuman Khan: University of Engineering and Management
Rajeev Arya: National Institute of Technology Patna
Boykuziev Ilkhom: National University of Uzbekistan
Abdurakhimov Bakhtiyor: National University of Uzbekistan
Nuriddin Safoyev: Tashkent University of Information Technologies
Zarif Khudoykulov: Tashkent University of Information Technologies

International Journal of System Assurance Engineering and Management, 2024, vol. 15, issue 6, No 31, 2400 pages

Abstract: 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.

Keywords: Cryptography; Key generation; Encryption; Decryption; Plain text; Cipher text (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13198-024-02253-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:ijsaem:v:15:y:2024:i:6:d:10.1007_s13198-024-02253-7

Ordering information: This journal article can be ordered from
http://www.springer.com/engineering/journal/13198

DOI: 10.1007/s13198-024-02253-7

Access Statistics for this article

International Journal of System Assurance Engineering and Management is currently edited by P.K. Kapur, A.K. Verma and U. Kumar

More articles in International Journal of System Assurance Engineering and Management from Springer, The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().