GRAPH-BASED CRYPTOGRAPHIC KEY GENERATION FOR SECURE TEXT ENCRYPTION

Authors : Yılmaz Gür, Hülya Gür

Pages : 288-309

Doi:10.28956/gbd.1669030

View : 104 | Download : 116

Publication Date : 2025-10-27

Article Type : Research Paper

Abstract :The purpose of this article is to use a novel text encryption technique that ensures secure communication through a two-phase process and to use the encryption technique to demonstrate the connection between graph theory and cryptography. In this article, the spanning tree graph, which is a subgraph of an undirected graph used in graph theory and includes all vertices of the graph G, will be used. The first phase employs a monoalphabetic substitution cipher, utilizing predefined character-swapping arrangements between authorized individuals along with an alphabetical encryption table. The second phase enhances security by leveraging graph theory for key generation. Specifically, the Kruskal algorithm is used to compute the minimum spanning tree, enabling the creation of intricate encrypted text with a shared key derived from graph structures. By utilizing properties such as adjacency matrices, spanning trees, and graph isomorphisms, the proposed method strengthens cryptographic security while maintaining computational efficiency. The security analysis demonstrates its resilience against common cryptographic attacks, making it a promising alternative for secure text encryption and communication.
Keywords : Graf Teorisi, Şifreleme, Şifre Çözme, Kriptografi

ORIGINAL ARTICLE URL