Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
public:thesis:kubicek2017 [2017-05-22 09:23] – [Results] xkubice8public:thesis:kubicek2017 [2017-06-21 15:48] (current) – [Optimisation heuristics in randomness testing] xkubice8
Line 1: Line 1:
 ====== Optimisation heuristics in randomness testing ====== ====== Optimisation heuristics in randomness testing ======
  
-**Karel Kubíček, master thesis, spring 2017**+**Karel Kubíček [[karel.kubicek@mail.muni.cz]], master thesis, spring 2017**
  
 **Keywords:** //randomness testing, cryptanalysis, block functions, stream functions, hash functions, problem optimization, metaheuristics// **Keywords:** //randomness testing, cryptanalysis, block functions, stream functions, hash functions, problem optimization, metaheuristics//
Line 12: Line 12:
 //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.// //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 thesis {{ :public:thesis:thesis-pc.pdf |pdf}}, presentation {{ :public:thesis:pres.pdf |pdf}}
   * 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:   * List of tools: