On the Difficulty of Breaking Substitution Ciphers
| dc.contributor.advisor | Dolgopyat, Dmitry | en_US |
| dc.contributor.author | Wertheimer, Phil | en_US |
| dc.contributor.department | Mathematics | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2022-02-04T06:38:11Z | |
| dc.date.available | 2022-02-04T06:38:11Z | |
| dc.date.issued | 2021 | en_US |
| dc.description.abstract | We analyze different methods of attacking substitution ciphers using $m$-gram frequency analysis. For $m=1$ this amounts to studying symbol counts in random strings, and for $m\geq 2$ we use the Markov Chain Monte Carlo method introduced by Diaconis \cite{mcmcr}. Our study includes both numerical simulations of the English language and theoretical analysis of random alphabets, which are probabilistic constructions for studying the distribution of $m$-grams in random strings. We present several results in the direction of explaining why the $2$-gram method performs the best in breaking the substitution ciphers. | en_US |
| dc.identifier | https://doi.org/10.13016/zlm4-mkns | |
| dc.identifier.uri | http://hdl.handle.net/1903/28455 | |
| dc.language.iso | en | en_US |
| dc.subject.pqcontrolled | Theoretical mathematics | en_US |
| dc.title | On the Difficulty of Breaking Substitution Ciphers | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Wertheimer_umd_0117E_22104.pdf
- Size:
- 440.36 KB
- Format:
- Adobe Portable Document Format