Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision		 Previous revision
Next revisionBoth sides next revision
public:thesis:kubicek2017 [2017-04-25 20:42] – created xkubice8public:thesis:kubicek2017 [2017-05-22 09:02] – [Bibtex] xkubice8
Line 3: Line 3:
 **Karel Kubíček, master thesis, spring 2017** **Karel Kubíček, master thesis, spring 2017**
  
-**Keywords:** //TODO//+**Keywords:** //randomness testing, cryptanalysis, block functions, stream functions, hash functions, problem optimization, metaheuristics//
  
-**Abstract:** //TODO//+**Abstract:**
  
-  * Download thesis pdf, presentation pdf: TODO+//A detectable non-randomness of cryptoprimitive's output signals a bias of the cryptographic function. This bias may signal deeper security issues of the primitive. Therefore, statistical testing of randomness is one of the automated ways of cryptanalysis. Randomness assessment by statistical batteries is an example of such automated cryptanalysis. Research tool EACirc developed at Faculty of Informatics, Masaryk University aims to design the randomness tests, which adapts to the tested data. The tool utilises a simple heuristic based on local search. This thesis researches other metaheuristics and their influence on EACirc's success rate. In extension, proof of concept artificial neural network for randomness testing was analysed.// 
 + 
 + 
 +//This thesis has three main contributions. The first is a development of a testbed of 16 well-known cryptographic functions used for randomness testing comparison. The second is an extension of EACirc by three new metaheuristics. One of them, called guided local search, outperforms all the others in terms of its success rate. The third contribution is an analysis of randomness tests produced by EACirc computation. Successful tests contain evidence of the bias in the tested data. The influence of tested metaheuristics on the complexity of these tests is analysed. It is shown that the guided local search produces the least complex tests, such that allow easier cryptanalysis.// 
 + 
 +  * Download thesis {{ :public:thesis:thesis-pc.pdf |pdf}}, presentation will be added after thesis defence
   * Download [[https://drive.google.com/drive/folders/0B5Z1zst5NzwXQmFKaXgxREJWNk0?usp=sharing|dataset]]   * Download [[https://drive.google.com/drive/folders/0B5Z1zst5NzwXQmFKaXgxREJWNk0?usp=sharing|dataset]]
-  * List of tools: TODO +  * List of tools: 
-    * EACirc (metaheuristics branch) +    * [[https://github.com/crocs-muni/eacirc/tree/metaheuristics|EACirc (metaheuristics branch)]] 
-    * Generator +    * [[https://github.com/crocs-muni/eacirc-streams|Generator]] 
-    * Neural network +    * [[https://github.com/crocs-muni/eanet|Neural network]] 
-    * Automation scripts+    * [[https://github.com/crocs-muni/eacirc-utils|Automation scripts]]
  
 ===== Bibtex ===== ===== Bibtex =====
  
 +<code>
 +@thesis{kubicekMasterThesis,
 +    author = {Karel Kubíček},
 +    supervisor = {Petr Švenda}, 
 +    title = {{Optimisation heuristics in randomness testing}},
 +    type = {Master thesis},
 +    institution = {Faculty of Informatics Masaryk University},
 +    year = {2017},
 +    url = {http://is.muni.cz/th/408351/fi_m/},
 +}
 +</code>
 ===== Results ===== ===== Results =====