{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T23:40:30Z","timestamp":1680392430655},"reference-count":32,"publisher":"Walter de Gruyter GmbH","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this paper we first investigate the use of Markov Chain Monte Carlo (MCMC) methods to attack classical ciphers. MCMC has previously been used to break simple substitution, transposition and substitution-transposition ciphers. Here, we improve the accuracy of obtained results by these algorithms and we show the performance of the algorithms using quasi random numbers such as Faure, Sobol and Niederreiter sequences.<\/jats:p>","DOI":"10.1515\/mcma-2016-0116","type":"journal-article","created":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T08:10:51Z","timestamp":1476173451000},"page":"323-335","source":"Crossref","is-referenced-by-count":0,"title":["Improved Markov Chain Monte Carlo method for cryptanalysis substitution-transposition cipher"],"prefix":"10.1515","volume":"22","author":[{"given":"Behrouz","family":"Fathi-Vajargah","sequence":"first","affiliation":[{"name":"Department of Statistics, University of Guilan, Rasht, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohadeseh","family":"Kanafchian","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Guilan, Rasht, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2016,10,11]]},"reference":[{"key":"#cr-split#-2023040102000319698_j_mcma-2016-0116_ref_001_w2aab2b8d988b1b7b1ab2ab1Aa.1","doi-asserted-by":"crossref","unstructured":"Antonov I. A. and Saleev V. M., An economic method of computing L\u2062PT${LP_{T}}$-sequences, Zh. Vychisl. Mat. Fiz. 19 (1979), 243-245","DOI":"10.1016\/0041-5553(79)90085-5"},{"key":"#cr-split#-2023040102000319698_j_mcma-2016-0116_ref_001_w2aab2b8d988b1b7b1ab2ab1Aa.2","doi-asserted-by":"crossref","unstructured":"translation in: USSR Comput. Math. Math. Phys. 19 (1979), 252-256.","DOI":"10.1016\/0041-5553(79)90085-5"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_002_w2aab2b8d988b1b7b1ab2ab2Aa","unstructured":"Battacharya R. N. and Waymire E. C.,\nStochastic Processes with Applications,\nJohn Wiley & Sons, New York, 1990."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_003_w2aab2b8d988b1b7b1ab2ab3Aa","unstructured":"Besag J.,\nMarkov chain Monte Carlo for statistical inference,\nWorking paper no. 9, Center for Statistics and the Social Sciences, University of Washington, 2001;\navailable from www.csss.washington.edu\/Papers\/."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_004_w2aab2b8d988b1b7b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"Besag J., Green P., Higdon D. and Mengersen K.,\nBayesian computation and stochastic systems,\nStatist. Sci. 10 (1995), 3\u201341.","DOI":"10.1214\/ss\/1177010123"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_005_w2aab2b8d988b1b7b1ab2ab5Aa","doi-asserted-by":"crossref","unstructured":"Bratley P. and Fox B. L.,\nAlgorithm 659: Implementing Sobol\u2019s quasi-random sequence generator,\nACM Trans. Math. Software 14 (1988), 88\u2013100.","DOI":"10.1145\/42288.214372"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_006_w2aab2b8d988b1b7b1ab2ab6Aa","doi-asserted-by":"crossref","unstructured":"Brooks S. P.,\nMarkov chain Monte Carlo method and its application,\nStatistician 47 (1998), 69\u2013100.","DOI":"10.1111\/1467-9884.00117"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_007_w2aab2b8d988b1b7b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"Cai H.,\nA random cluster algorithm for some continuous Markov random fields,\nJ. Stat. Comput. Simul. 79 (2009), 1287\u20131299.","DOI":"10.1080\/00949650802261087"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_008_w2aab2b8d988b1b7b1ab2ab8Aa","unstructured":"Connor S.,\nSimulation and solving substitution code,\nMaster\u2019s thesis, Department of Statistics, University of Warwick, Coventry, 2003."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_009_w2aab2b8d988b1b7b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"Diaconis P.,\nThe Markov chain Monte Carlo revolution,\nBull. Amer. Math. Soc. 46 (2009), 179\u2013205.","DOI":"10.1090\/S0273-0979-08-01238-X"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_010_w2aab2b8d988b1b7b1ab2ac10Aa","doi-asserted-by":"crossref","unstructured":"Fathi-Vajargah B. and Eskandari-Chechaglou A.,\nOptimal Halton Sequence via Inversive Scrambling,\nComm. Statist. Simulation Comput. 42 (2013), 476\u2013484.","DOI":"10.1080\/03610918.2011.650255"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_011_w2aab2b8d988b1b7b1ab2ac11Aa","doi-asserted-by":"crossref","unstructured":"Fleischer K.,\nTwo tests of pseudo random number generators for independence and uniform distribution,\nJ. Stat. Comput. Simul. 52 (1996), 311\u2013322.","DOI":"10.1080\/00949659508811682"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_012_w2aab2b8d988b1b7b1ab2ac12Aa","doi-asserted-by":"crossref","unstructured":"Furon T., Guyader A. and Cerou F.,\nDecoding fingerprints using the Markov chain Monte Carlo method,\n2012 IEEE International Workshop on Information Forensics and Security (WIFS),\nIEEE Press, Piscataway (2012), 187\u2013192.","DOI":"10.1109\/WIFS.2012.6412647"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_013_w2aab2b8d988b1b7b1ab2ac13Aa","unstructured":"Garg P.,\nCryptanalysis of sdes via evolutionary computation techniques,\npreprint 2009, https:\/\/arxiv.org\/abs\/0906.5123."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_014_w2aab2b8d988b1b7b1ab2ac14Aa","unstructured":"Gentle J. E.,\nRandom Number Generation and Monte Carlo Methods,\nSpringer, New York, 2005."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_015_w2aab2b8d988b1b7b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"Gilks W. R., Richardson S. and Spiegelhalter D. J.,\nMarkov Chain Monte Carlo in Practice,\nChapman and Hall, London, 1996.","DOI":"10.1201\/b14835"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_016_w2aab2b8d988b1b7b1ab2ac16Aa","doi-asserted-by":"crossref","unstructured":"Gilks W. and Roberts G.,\nStrategies for improving MCMC,\nMarkov Chain Monte Carlo in Practice,\nChapman & Hall\/CRC, Boca Raton (1996), 89\u2013110.","DOI":"10.1201\/b14835"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_017_w2aab2b8d988b1b7b1ab2ac17Aa","unstructured":"Hanawal M. K. and Sundaresan R.,\nRandomised attacks on passwords,\nTechnical Report TR-PME-2010-11, DRDO-IISc Programme on Advanced Research in Mathematical Engineering, Bangalore, 2010."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_018_w2aab2b8d988b1b7b1ab2ac18Aa","doi-asserted-by":"crossref","unstructured":"Kroese D. P., Taimre T. and Botev Z. I.,\nHandbook of Monte Carlo Methods,\nJohn Wiley & Sons, Hoboken, 2011.","DOI":"10.1002\/9781118014967"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_019_w2aab2b8d988b1b7b1ab2ac19Aa","doi-asserted-by":"crossref","unstructured":"Matsui A., Clippingdale S., Uzawa F. and Matsumoto T.,\nBayesian face recognition using a Markov chain Monte Carlo method,\nProceedings of the 17th International Conference on Pattern Recognition (ICPR\u201904). Volume 3,\nIEEE Computer Society, Washington (2004), 918\u2013921.","DOI":"10.1109\/ICPR.2004.1334678"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_020_w2aab2b8d988b1b7b1ab2ac20Aa","doi-asserted-by":"crossref","unstructured":"Matthews R. A. J.,\nThe use of genetic algorithms in cryptanalysis,\nCryptologia 12 (1993), 187\u2013201.","DOI":"10.1080\/0161-119391867863"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_021_w2aab2b8d988b1b7b1ab2ac21Aa","unstructured":"Menezes A. J., Van Orschot P. C. and Vanstone S. A.,\nHandbook of Applied Cryptography,\nCRC Press, Boca Raton, 2001."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_022_w2aab2b8d988b1b7b1ab2ac22Aa","doi-asserted-by":"crossref","unstructured":"Muramatsu D., Kondo M., Sasaki M. and Tachibana S.,\nA Markov chain Monte Carlo algorithm for bayesian dynamic signature verification,\nIEEE Trans. Inf. Forensics Sec. 1 (2006), no. 1, 22\u201334.","DOI":"10.1109\/TIFS.2005.863507"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_023_w2aab2b8d988b1b7b1ab2ac23Aa","doi-asserted-by":"crossref","unstructured":"Metropolis N., Rosenbluth A., Rosenbluth M., Teller A. and Teller E.,\nEquations of state calculations by fast computing machines,\nJ. Chem. Phys. 21 (1953), 1087\u20131091.","DOI":"10.1063\/1.1699114"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_024_w2aab2b8d988b1b7b1ab2ac24Aa","doi-asserted-by":"crossref","unstructured":"Niederreiter H.,\nQuasi-Monte Carlo methods and pseudo-random numbers,\nBull. Amer. Math. Soc. 84 (1978), 957\u20131041.","DOI":"10.1090\/S0002-9904-1978-14532-7"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_025_w2aab2b8d988b1b7b1ab2ac25Aa","unstructured":"Ooi K. S. and Vito B. C.,\nCryptanalysis of S-DES,\nhttp:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.79.6617."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_026_w2aab2b8d988b1b7b1ab2ac26Aa","doi-asserted-by":"crossref","unstructured":"Paulsen J.,\nImpact of random number generators in time series Monte Carlo simulation,\nJ. Stat. Comput. Simul. 19 (1984), 23\u201333.","DOI":"10.1080\/00949658408810711"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_027_w2aab2b8d988b1b7b1ab2ac27Aa","doi-asserted-by":"crossref","unstructured":"Roberts G. O. and Rosenthal J. S.,\nGeneral state space Markov chains and MCMC algorithms,\nProbab. Surv. 1 (2004), 20\u201371.","DOI":"10.1214\/154957804100000024"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_028_w2aab2b8d988b1b7b1ab2ac28Aa","unstructured":"Rosenthal J. S.,\nQuantitative convergence rates of Markov chains: A simple account,\nElectron. Commun. Probab. 13 (2012), 123\u2013128."},{"key":"2023040102000319698_j_mcma-2016-0116_ref_029_w2aab2b8d988b1b7b1ab2ac29Aa","doi-asserted-by":"crossref","unstructured":"Rosenthal J. S. and Chen J.,\nDecrypting classical cipher text using Markov chain Monte Carlo,\nStat. Comput. 22 (2012), 397\u2013413.","DOI":"10.1007\/s11222-011-9232-5"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_030_w2aab2b8d988b1b7b1ab2ac30Aa","doi-asserted-by":"crossref","unstructured":"Stinson D. R.,\nCryptography: Theory and Practice,\nChapman & Hall\/CRCPress, Boca Raton, 2005.","DOI":"10.1201\/9781420057133"},{"key":"2023040102000319698_j_mcma-2016-0116_ref_031_w2aab2b8d988b1b7b1ab2ac31Aa","doi-asserted-by":"crossref","unstructured":"Willemain T. R. and Desautels A. P.,\nA method to generate autocorrelated uniform random numbers,\nJ. Stat. Comput. Simul. 45 (1993), 23\u201331.","DOI":"10.1080\/00949659308811469"}],"container-title":["Monte Carlo Methods and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/mcma.2016.22.issue-4\/mcma-2016-0116\/mcma-2016-0116.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2016-0116\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2016-0116\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T23:07:20Z","timestamp":1680390440000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2016-0116\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,11]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2016,11,17]]},"published-print":{"date-parts":[[2016,12,1]]}},"alternative-id":["10.1515\/mcma-2016-0116"],"URL":"https:\/\/doi.org\/10.1515\/mcma-2016-0116","relation":{},"ISSN":["0929-9629","1569-3961"],"issn-type":[{"value":"0929-9629","type":"print"},{"value":"1569-3961","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,11]]}}}