Affiliation:
1. Univ. of Maryland, College Park
Abstract
Substitution ciphers are codes in which each letter of the alphabet has one fixed substitute, and the word divisions do not change. In this paper the problem of breaking substitution ciphers is represented as a probabilistic labeling problem. Every code letter is assigned probabilities of representing plaintext letters. These probabilities are updated in parallel for all code letters, using joint letter probabilities. Iterating the updating scheme results in improved estimates that finally lead to breaking the cipher. The method is applied successfully to two examples.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Gaines H.F. Cryptanalysis. Dover New York 1956. Gaines H.F. Cryptanalysis. Dover New York 1956.
2. Kirby R. A product rule relaxation method. To appear in Comptr. Graphics and Image Processing. Kirby R. A product rule relaxation method. To appear in Comptr. Graphics and Image Processing.
3. Ambiguity reduction in handwriting with ambiguous segmentation and uncertain interpretation
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Introduction to Local Entropy and Local Unicity;2022 International Symposium on Networks, Computers and Communications (ISNCC);2022-07-19
2. A Venona Style Attack to Determine Block Size, Language, and Attacking Ciphers;2022 International Symposium on Networks, Computers and Communications (ISNCC);2022-07-19
3. Space Selection and Abstraction in Set Theoretic Estimation;2022 IEEE 12th Annual Computing and Communication Workshop and Conference (CCWC);2022-01-26
4. DNA Privacy: Analyzing Malicious DNA Sequences using Deep Neural Networks;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2021
5. Automated cryptanalysis of substitution cipher using Hill climbing with well designed heuristic function;Mathematica Montisnigri;2019