Analyzing Cryptographic Algorithm Efficiency with in Graph-Based Encryption Models

Yashmin Banu^1*Biplab Kumar Rath¹Dr. Debasis Gountia²

• ¹GIET University, Rayagada, India
• ²Odisha University of Technology and Research, Bhubaneswar, India

This research paper investigates the efficiency of cryptographic algorithms within graph-based encryption models such as star graph, focusing on their computational performance and security robustness. In this study, we analyze the performance of RSA and ElGamal cryptographic algorithms by evaluating time and space complexity across various file types, including text, image, audio, and data of different sizes. The encryption process is modeled using graph structures such as the Star graph, along with other well-known algorithms like A*, Dijkstra, Bellman-Ford, and Floyd-Warshall for comparative analysis and performance benchmarking. Consequently, this research conducts a comparative analysis of RSA and ElGamal cryptographic algorithms by applying them to mixed data, including binary, text, and image files. The CPU's internal clock was employed to record the execution time of encryption and decryption operations, facilitating the assessment of time complexity for both algorithms. The CPU's internal memory was employed to monitor and record memory usage during the encryption and decryption operations performed on mixed datasets. Accordingly, the evaluation of the encryption algorithms was conducted using criteria such as encryption time, decryption time, and throughput to determine their relative performance. In evaluating cryptographic approaches, factors such as response time, confidentiality, bandwidth, and integrity are considered. Experimental results indicate that RSA demonstrates superior time efficiency and resource utilization, whereas the ElGamal algorithm exhibits greater memory efficiency and resourcefulness.