Optimization of Classical Cryptography by Modern Programming Languages
DOI:
https://doi.org/10.54097/6ynccd18Keywords:
Caesar cipher, Vigenère Cipher, Frequency Attack.Abstract
The Caesar cipher’s vulnerability stems from its preservation of linguistic patterns, enabling a systematic decryption approach. By leveraging Python, the cracking process efficiently tests all possible shifts through automated decryption. Each attempted solution undergoes dual evaluation, statistical frequency analysis measures alignment with characteristic English letter distributions, while dictionary validation confirms the presence of legitimate vocabulary. These complementary techniques generate reliability scores for every candidate text. Moreover, this study extends the analysis to the Vigenère cipher and exploring how its polyalphabetic structure interacts with computational attacks. Ultimately, the highest-scoring outcome reliably identifies both the original messages and encryption key, demonstrating how computational power combined with linguistic insight can overcome classical cryptography’s limitations through methodical analysis rather than mere brute force, and paving the way for understanding how modern programming languages can optimize and challenge classical cryptographic systems.
Downloads
References
[1] M Li, D Lu, Y Xiang, Y Zhang, H Ren, (2019). Cryptanalysis and improvement in a chaotic image cipher using two-round permutation and diffusion.
[2] Anupama Mishra, (2013). Enancing security of Caesar cipher using different method.
[3] Stamp, M., & Low, R. M., (2007). Applied Cryptanalysis: Breaking Ciphers in the Real World. John Wiley & Sons.
[4] J He, H Qian, Y Zhou, Z Li, (2010). Cryptanalysis and improvement of a block cipher based on multiple chaotic systems.
[5] M Li, D Lu, Y Xiang, Y Zhang, H Ren, (2019) Cryptanalysis and improvement in a chaotic image cipher using two-round permutation and diffusion.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Highlights in Science, Engineering and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







