Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
| public:thesis:kubicek2017 [2017-05-22 16:41] – [Optimisation heuristics in randomness testing] xkubice8 | public:thesis:kubicek2017 [2017-06-21 15:48] (current) – [Optimisation heuristics in randomness testing] xkubice8 | ||
|---|---|---|---|
| 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 {{ : | + | * Download thesis {{ : |
| * Download [[https:// | * Download [[https:// | ||
| * List of tools: | * List of tools: | ||