Classic cryptanalysis using hidden Markov models

被引：5

作者：

Vobbilisetty, Rohit ^{[2
]}

Di Troia, Fabio ^{[1
]}

Low, Richard M. ^{[3
]}

Visaggio, Corrado Aaron ^{[4
]}

Stamp, Mark ^{[5
,6
]}

机构：

[1] San Jose State Univ, Dept Comp Sci, One Washington Sq, San Jose, CA 95192 USA

[2] Intuit, Mountain View, CA USA

[3] San Jose State Univ, Dept Math, San Jose, CA 95192 USA

[4] Univ Sannio, Software Secur MsC Comp Engn, Benevento, Italy

[5] Natl Secur Agcy, Benevento, Italy

[6] San Jose State Univ, Comp Sci, San Jose, CA 95192 USA

来源：

CRYPTOLOGIA | 2017年 / 41卷 / 01期

关键词：

cryptanalysis; hidden Markov models; Jakobsen's algorithm; Purple cipher; simple substitution;

D O I：

10.1080/01611194.2015.1126660

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this article, the authors present a detailed introduction to hidden Markov models (HMM). They then apply HMMs to the problem of solving simple substitution ciphers, and they empirically determine the accuracy as a function of the ciphertext length and the number of random restarts. Application to homophonic substitutions and other classic ciphers is briefly considered.

引用

页码：1 / 28

页数：28

共 15 条

[1]

[Anonymous], 1980, HIDDEN MARKOV MODELS

[2]

[Anonymous], PROCEEDINGS OF THE I

[3]

Berg-Kirkpatrick Taylor, 2013, P 2013 C EMPIRICAL M, P874

[4]

Bhandarkar Milind, 2010, Proceedings of the 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), DOI 10.1109/IPDPS.2010.5470377

[5]

Dao T., 2005, PURPLE CIPHER SIMULA

[6] Efficient Cryptanalysis of Homophonic Substitution Ciphers [J].

Dhavare, Amrapali ;

Low, Richard M. ;

Stamp, Mark .

CRYPTOLOGIA, 2013, 37 (03) :250-281

[7]

Freeman W., 2005, CRYPTOLOGIA, V29, P193

[8]

Hymel S, 2011, THESIS

[9]

Jakobsen T., 1995, Cryptologia, V19, P265, DOI 10.1080/0161-119591883944

[10] GPU computing [J].

Owens, John D. ;

Houston, Mike ;

Luebke, David ;

Green, Simon ;

Stone, John E. ;

Phillips, James C. .

PROCEEDINGS OF THE IEEE, 2008, 96 (05) :879-899

← 1 2 →