SSKA: secure symmetric encryption exploiting Kuznyechik algorithm for trustworthy communication

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of system assurance engineering and management 2024, Vol.15 (6), p.2391-2400
Hauptverfasser: Das, Rupayan, Khan, Angshuman, Arya, Rajeev, Ilkhom, Boykuziev, Bakhtiyor, Abdurakhimov, Safoyev, Nuriddin, Khudoykulov, Zarif
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0975-6809
0976-4348
DOI:10.1007/s13198-024-02253-7