Improved Markov Chain Monte Carlo method for cryptanalysis substitution-transposition cipher

References

[1] Antonov I. A. and Saleev V. M., An economic method of computing L⁢PT-sequences, Zh. Vychisl. Mat. Fiz. 19 (1979), 243–245; translation in: USSR Comput. Math. Math. Phys. 19 (1979), 252–256. Search in Google Scholar

[2] Battacharya R. N. and Waymire E. C., Stochastic Processes with Applications, John Wiley & Sons, New York, 1990. Search in Google Scholar

[3] Besag J., Markov chain Monte Carlo for statistical inference, Working paper no. 9, Center for Statistics and the Social Sciences, University of Washington, 2001; available from www.csss.washington.edu/Papers/. Search in Google Scholar

[4] Besag J., Green P., Higdon D. and Mengersen K., Bayesian computation and stochastic systems, Statist. Sci. 10 (1995), 3–41. 10.1214/ss/1177010123Search in Google Scholar

[5] Bratley P. and Fox B. L., Algorithm 659: Implementing Sobol’s quasi-random sequence generator, ACM Trans. Math. Software 14 (1988), 88–100. 10.1145/42288.214372Search in Google Scholar

[6] Brooks S. P., Markov chain Monte Carlo method and its application, Statistician 47 (1998), 69–100. 10.1111/1467-9884.00117Search in Google Scholar

[7] Cai H., A random cluster algorithm for some continuous Markov random fields, J. Stat. Comput. Simul. 79 (2009), 1287–1299. 10.1080/00949650802261087Search in Google Scholar

[8] Connor S., Simulation and solving substitution code, Master’s thesis, Department of Statistics, University of Warwick, Coventry, 2003. Search in Google Scholar

[9] Diaconis P., The Markov chain Monte Carlo revolution, Bull. Amer. Math. Soc. 46 (2009), 179–205. 10.1090/S0273-0979-08-01238-XSearch in Google Scholar

[10] Fathi-Vajargah B. and Eskandari-Chechaglou A., Optimal Halton Sequence via Inversive Scrambling, Comm. Statist. Simulation Comput. 42 (2013), 476–484. 10.1080/03610918.2011.650255Search in Google Scholar

[11] Fleischer K., Two tests of pseudo random number generators for independence and uniform distribution, J. Stat. Comput. Simul. 52 (1996), 311–322. 10.1080/00949659508811682Search in Google Scholar

[12] Furon T., Guyader A. and Cerou F., Decoding fingerprints using the Markov chain Monte Carlo method, 2012 IEEE International Workshop on Information Forensics and Security (WIFS), IEEE Press, Piscataway (2012), 187–192. 10.1109/WIFS.2012.6412647Search in Google Scholar

[13] Garg P., Cryptanalysis of sdes via evolutionary computation techniques, preprint 2009, https://arxiv.org/abs/0906.5123. Search in Google Scholar

[14] Gentle J. E., Random Number Generation and Monte Carlo Methods, Springer, New York, 2005. Search in Google Scholar

[15] Gilks W. R., Richardson S. and Spiegelhalter D. J., Markov Chain Monte Carlo in Practice, Chapman and Hall, London, 1996. 10.1201/b14835Search in Google Scholar

[16] Gilks W. and Roberts G., Strategies for improving MCMC, Markov Chain Monte Carlo in Practice, Chapman & Hall/CRC, Boca Raton (1996), 89–110. 10.1201/b14835-11Search in Google Scholar

[17] Hanawal M. K. and Sundaresan R., Randomised attacks on passwords, Technical Report TR-PME-2010-11, DRDO-IISc Programme on Advanced Research in Mathematical Engineering, Bangalore, 2010. Search in Google Scholar

[18] Kroese D. P., Taimre T. and Botev Z. I., Handbook of Monte Carlo Methods, John Wiley & Sons, Hoboken, 2011. 10.1002/9781118014967Search in Google Scholar

[19] Matsui A., Clippingdale S., Uzawa F. and Matsumoto T., Bayesian face recognition using a Markov chain Monte Carlo method, Proceedings of the 17th International Conference on Pattern Recognition (ICPR’04). Volume 3, IEEE Computer Society, Washington (2004), 918–921. 10.1109/ICPR.2004.1334678Search in Google Scholar

[20] Matthews R. A. J., The use of genetic algorithms in cryptanalysis, Cryptologia 12 (1993), 187–201. 10.1080/0161-119391867863Search in Google Scholar

[21] Menezes A. J., Van Orschot P. C. and Vanstone S. A., Handbook of Applied Cryptography, CRC Press, Boca Raton, 2001. Search in Google Scholar

[22] Muramatsu D., Kondo M., Sasaki M. and Tachibana S., A Markov chain Monte Carlo algorithm for bayesian dynamic signature verification, IEEE Trans. Inf. Forensics Sec. 1 (2006), no. 1, 22–34. 10.1109/TIFS.2005.863507Search in Google Scholar

[23] Metropolis N., Rosenbluth A., Rosenbluth M., Teller A. and Teller E., Equations of state calculations by fast computing machines, J. Chem. Phys. 21 (1953), 1087–1091. 10.2172/4390578Search in Google Scholar

[24] Niederreiter H., Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc. 84 (1978), 957–1041. 10.1090/S0002-9904-1978-14532-7Search in Google Scholar

[25] Ooi K. S. and Vito B. C., Cryptanalysis of S-DES, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.6617. Search in Google Scholar

[26] Paulsen J., Impact of random number generators in time series Monte Carlo simulation, J. Stat. Comput. Simul. 19 (1984), 23–33. 10.1080/00949658408810711Search in Google Scholar

[27] Roberts G. O. and Rosenthal J. S., General state space Markov chains and MCMC algorithms, Probab. Surv. 1 (2004), 20–71. 10.1214/154957804100000024Search in Google Scholar

[28] Rosenthal J. S., Quantitative convergence rates of Markov chains: A simple account, Electron. Commun. Probab. 13 (2012), 123–128. 10.1214/ECP.v7-1054Search in Google Scholar

[29] Rosenthal J. S. and Chen J., Decrypting classical cipher text using Markov chain Monte Carlo, Stat. Comput. 22 (2012), 397–413. 10.1007/s11222-011-9232-5Search in Google Scholar

[30] Stinson D. R., Cryptography: Theory and Practice, Chapman & Hall/CRCPress, Boca Raton, 2005. 10.1201/9781420057133Search in Google Scholar

[31] Willemain T. R. and Desautels A. P., A method to generate autocorrelated uniform random numbers, J. Stat. Comput. Simul. 45 (1993), 23–31. 10.1080/00949659308811469Search in Google Scholar