Abstract
We investigate the use of Markov Chain Monte Carlo (MCMC) methods to attack classical ciphers. MCMC has previously been used to break simple substitution ciphers. Here, we extend this approach to transposition ciphers and to substitution-plus-transposition ciphers. Our algorithms run quickly and perform fairly well even for key lengths as high as 40.
Similar content being viewed by others
References
Connor, S.: Simulation and solving substitution codes. Master’s thesis, Department of Statistics, University of Warwick (2003)
Diaconis, P.: Group Representations in Probability and Statistics. IMS Lecture Series, vol. 11. Institute of Mathematical Statistics, Hayward (1988)
Diaconis, P.: The Markov chain Monte Carlo revolution. Bull. Am. Math. Soc., Nov. (2008)
Dimovski, A., Gligoroski, D.: Attacks on the transposition ciphers using optimization heuristics. In: Proceedings of the XXXVIII International Scientific Conference on Information, Communication & Energy Systems & Technologies. Heron Press, Birmingham (2003)
Garg, P.: Cryptanalysis of SDES via. evolutionary computation techniques. IJCSIS 1(1) (2009)
Gilks, W.R., Richardson, S., Spiegelhalter, D.J. (eds.): Markov Chain Monte Carlo in Practice. Chapman and Hall, London (1996)
Ice Hockey (Wikipedia Page): http://en.wikipedia.org/wiki/Ice_hockey
Matthews, R.A.J.: The use of genetic algorithms in cryptanalysis. Cryptologia 17(2), 187–201 (1993)
Menezes, A., van Oorschot, P., Vanstone, S. (eds.): Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1091 (1953)
Ooi, K.S., Vito, B.C.: Cryptanalysis of S-DES. Available. at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.6617 (2002)
Project Gutenberg: http://www.gutenberg.org/
Roberts, G.O., Rosenthal, J.S.: General state space Markov chains and MCMC algorithms. Probab. Surv. 1, 20–71 (2004)
Rosenthal, J.S.: Quantitative convergence rates of Markov chains: a simple account. Electron. Commun. Probab. 7(13), 123–128 (2002)
Rosenthal, J.S.: A First Look at Rigorous Probability Theory, 2nd edn. World Scientific, Singapore (2006)
Schneier, B.: Applied Cryptography, 2nd edn. Wiley, New York (1996)
Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656–715 (1949)
Stinson, D.R.: Cryptography: Theory and Practice, 3rd edn. Chapman & Hall/CRC Press, Boca Raton (2005)
Tierney, L.: Markov chains for exploring posterior distributions (with discussion). Ann. Stat. 22, 1701–1762 (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by NSERC of Canada.
Rights and permissions
About this article
Cite this article
Chen, J., Rosenthal, J.S. Decrypting classical cipher text using Markov chain Monte Carlo. Stat Comput 22, 397–413 (2012). https://doi.org/10.1007/s11222-011-9232-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11222-011-9232-5