| Abstract | This study proposes an innovative encryption technique aimed at providing a high level of security for com-munication. The technique is implemented in two distinct stages. The first stage employs monoalphabetic ci-phers, a traditional method of encryption that substitutes each letter of the plaintext with a corresponding let-ter from a fixed alphabet. The second stage introduces the use of an alphabetic encryption table, which further refines the encryption process by applying a predefined arrangement of character transformations. This trans-formation scheme is agreed upon in advance by the authorized parties involved in the communication, ensur-ing that only they can decipher the message. To further encourage the security of the encryption process, the research integrates the Kurskal technique, a method from graph theory, into the encryption system. The Kurskal technique, commonly used for finding the minimum spanning tree in a graph, is adapted in this study to add an additional layer of complexity and security to the encrypted text. By incorporating this graph-theoretic approach, the study enhances the robustness of the encryption, making it more resistant to potential attacks and unauthorized access. The combination of monoalphabetic ciphers, the alphabetic encryption table, and the Kurskal technique provides a multi-faceted approach to secure communication, which can be particu-larly beneficial in contexts where data confidentiality is of paramount importance. This research contributes to the field of cryptography by presenting a novel encryption methodology that combines classical and modern encryption techniques to address contemporary security challenges.
This study was built upon the research of Yamuna et al [4], offering a numerical example to demonstrate the encryption and decryption method utilizing complete graphs. For that, matrix properties were employed to decode the transmitted message. |
