Deciphering System for Evaluating the Computational Complexity of Modern Cipher Algorithms

Cryptography plays a fundamental role in securing digital communication by protecting sensitive information against unauthorized access and cyberattacks. As the complexity of encryption algorithms increases, evaluating their computational performance becomes increasingly important for selecting suitable cryptographic techniques in different computing environments. This project presents a simple deciphering system for evaluating the computational complexity of modern cipher algorithms. The proposed system analyzes the computational behavior of cipher algorithms through several performance indicators, including encryption time, decryption time, memory utilization, throughput, entropy, and computational complexity. The framework consists of four principal stages: data input, encryption/decryption processing, performance monitoring, and report generation. A simple implementation was designed to demonstrate the evaluation process using representative encryption algorithms. The computational complexity was analyzed using Big-O notation, while execution time and memory usage were monitored during the encryption process. The generated report allows users to compare the efficiency of different algorithms using graphical visualization and statistical summaries. Two illustrative datasets were used to demonstrate the workflow of the system, and comparative results were presented using tables and charts. The proposed framework provides a straightforward methodology for understanding the relationship between computational complexity and cryptographic performance.