Master Thesis Online
Elementary statistical methods of cryptography
Etienne, Elodie 
Promotor(s) :
Haesbroeck, Gentiane
Date of defense : 2-Jul-2019/3-Jul-2019 • Permalink : http://hdl.handle.net/2268.2/6978
Memoire_Etienne_Elodie.pdfDetails
| Title : | Elementary statistical methods of cryptography |
| Author : | Etienne, Elodie
|
| Date of defense : | 2-Jul-2019/3-Jul-2019 |
| Advisor(s) : | Haesbroeck, Gentiane
|
| Committee's member(s) : | Charlier, Emilie
Rigo, Michel
Swan, Yvik
|
| Language : | English |
| Keywords : | [en] cryptography [en] statistics [en] cryptanalysis [en] code breaking [en] Kasiski [en] index of coincidence [en] Markov chain Monte Carlo [en] Turing [en] substitution cipher [en] transposition cipher [en] Vigenère cipher |
| Discipline(s) : | Physical, chemical, mathematical & earth Sciences > Mathematics |
| Target public : | Researchers Professionals of domain Student General public |
| Institution(s) : | Université de Liège, Liège, Belgique |
| Degree: | Master en sciences mathématiques, à finalité didactique |
| Faculty: | Master thesis of the Faculté des Sciences |
Abstract
[en] The goal of this thesis is to study the statistical methods allowing to decrypt messages where a brute attack will be unfeasible.
After the description of encryption techniques used in pre-modern cryptography and in the Second World War, we will present methods for breaking these classical ciphers with a brief presentation of the cryptanalysis needed to break wartime ciphers. Then, a bayesian method introduced by Turing in a wartime paper for breaking Vigenère cipher will be developed. This work will also investigate the use of Markov Chain Monte Carlo to attack substitution cipher and transposition cipher. Finally, we will discuss how to measure the performances of some techniques presented in the previous chapters based on simulations.
Cite this master thesis
The University of Liège does not guarantee the scientific quality of these students' works or the accuracy of all the information they contain.