A constraint satisfaction algorithm for the automated decryption of simple substitution ciphers
CRYPTO '88 Proceedings on Advances in cryptology
Breaking Substitution Cyphers Using Stochastic Automata
IEEE Transactions on Pattern Analysis and Machine Intelligence
Communications of the ACM
Learning Compatibility Coefficients for Relaxation Labeling Processes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Substitution Deciphering Based on HMMs with Applications to Compressed Document Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Evolutionary computation in computer security and cryptography
New Generation Computing - Evolutionary computation
Unsupervised analysis for decipherment problems
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Security in outsourcing of association rule mining
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Probabilistic Methods for a Japanese Syllable Cipher
ICCPOL '09 Proceedings of the 22nd International Conference on Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy
Attacking decipherment problems optimally with low-order N-gram models
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Bayesian inference for finite-state transducers
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
An exact A* method for deciphering letter-substitution ciphers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Bayesian inference for Zodiac and other homophonic ciphers
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
| Hi-index | 48.23 |
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.