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

Fathi-Vajargah Behrouz () and Kanafchian Mohadeseh ()
Additional contact information
Fathi-Vajargah Behrouz: Department of Statistics, University of Guilan, Rasht, Iran
Kanafchian Mohadeseh: Department of Statistics, University of Guilan, Rasht, Iran

Monte Carlo Methods and Applications, 2016, vol. 22, issue 4, 323-335

Abstract: 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.

Keywords: Markov Chain Monte Carlo; classical cipher; quasi random numbers (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1515/mcma-2016-0116 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bpj:mcmeap:v:22:y:2016:i:4:p:323-335:n:4

Ordering information: This journal article can be ordered from
https://www.degruyter.com/journal/key/mcma/html

DOI: 10.1515/mcma-2016-0116

Access Statistics for this article

Monte Carlo Methods and Applications is currently edited by Karl K. Sabelfeld

More articles in Monte Carlo Methods and Applications from De Gruyter
Bibliographic data for series maintained by Peter Golla ().