"Classic cryptanalysis using hidden Markov models" by Mark Stamp

Selected Works of Mark Stamp

Follow Contact

Article

Classic cryptanalysis using hidden Markov models

Cryptologia (2017)

Mark Stamp, San Jose State University

Link

Abstract

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.

Keywords

cryptanalysis,
hidden Markov models,
Jakobsen’s algorithm,
Purple cipher,
simple substitution

Disciplines

Computer Sciences

Publication Date

2017

DOI

10.1080/01611194.2015.1126660

Publisher Statement

SJSU Users: use the following link to login and access the article via SJSU databases.

Citation Information

Mark Stamp. "Classic cryptanalysis using hidden Markov models" Cryptologia Vol. 41 Iss. 1 (2017) p. 1 - 28 ISSN: 0161-1194
Available at: http://works.bepress.com/mark_stamp/32/