Comparative Analysis of Classical and Quantum Cryptography: Assessing Performance and Adaptability in a Simulated Environment

This research conducts a comprehensive comparative analysis of classical and quantum cryptographic algorithms, assessing their strengths and weaknesses regarding speed (referring to the time taken for encryption and decryption) and efficiency (effectiveness of a specific algorithm across the different inputs data provided). This research investigates four classical cryptographic algorithms, including ChaCha20, Advanced Encryption Standard (AES), Lai-Massey, and Blowfish, which were examined within the scope of this study. Employing a simulation framework, three distinct scenarios are evaluated: (1) behavior with limited lines of plaintext, (2) performance with extensive text, and (3) handling of both numerical and symbolic data. The primary objective of the research is to elucidate the adaptability and resilience of classical and quantum cryptographic approach across various input types. The findings indicate that while the classical approach maintains robustness and efficiency for small datasets, its performance varies when handling larger volumes and diverse data types. While not entirely immune to vulnerabilities—such as implementation flaws, channel noise, or side-channel attacks—the quantum approach demonstrates enhanced speed, depending on the key size and the nature of the input data, including plain text, numerical, and symbolic content. This paper highlights the contextual benefits of classical and quantum cryptographic approaches, stressing the importance of making well-informed decisions in cryptographic applications as technology evolves.