Abstract
The historical simple substitution cipher is widely known. In educational literature, the study of ciphers and attacks on them begins with it. Calculation of the complexity of attacks on a simple substitution cipher is usually ignored due to the simplicity of the implementation of these attacks. The question why there are no results on the assessment of the reliability of such attacks (the probability of achieving the goal of the task) remains open. From the practice of carrying out attacks on this cipher, it is believed that knowledge of 25–27 ciphertext characters is sufficient for the English and Russian languages. Claude Shannon proved this fact using the entropy per message letter he calculated. This article proposes a modernization of the ideas embodied in well-known attacks, which makes it possible to calculate the probability of correctly determining the plaintext of a simple substitution cipher using a known ciphertext.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Banks., M.J.: A search-based tool for the automated cryptanalysis of classical ciphers. 5th May 2008. https://www.researchgate.net/
Shneier, B.: Applied Cryptography, 2nd edn. Protocols, Algorthms, and Source Code in C (cloth). ISBN: 0471128457, Publication Date: 01/01/96
van Tilborg, H.C.A.: Encyclopedia of Cryptography and Security. Springer (2005)
Ferguson, N., Shneier, B.: Practical Cryptography (2003). rizkia.staff.telkomuniversity.ac.id
Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. Taylor & Francis Group LLC (2015)
van Tilborg, H.C.A.: Fundamentals of Cryptology. A Professional Reference and Interactive Tutorial. Kluwer Academic Publishers, Boston, Dordrecht, London (1999)
https://www.forensicfocus.com/articles/a-forensic-analysis-of-the-windows-registry/
https://www.slideshare.net/somutripathi/computer-forensics-windows-registry/
Babash, A.V., Shankin, G.P.: Cryptography. Solon-Press (2002)
Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656–715 (1949)
Chase, L., Rosenfeld, R., Ward, W.: Error-responsive modifications to speech recognizers: negative n-grams. In: Third International Conference on Spoken Language Processing, Yokohama (1994)
Andrews, G.E.: The Theory of Partitions. Addison-Wesley Publishing Company (1976)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author declares no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Babash, A.V. Attacks on the simple substitution cipher with the calculation of their reliability. J Comput Virol Hack Tech 20, 213–218 (2024). https://doi.org/10.1007/s11416-023-00464-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11416-023-00464-3