The objective of the thesis is to analyze statistical randomness of outputs generated by several authenticated encryption schemes. A number of candidates from the current cryptographic competition for authenticated encryption (CAESAR), ideally all of them, should be tested for indistinguishability from a truly random bitstream.

The chosen CAESAR candidates should be transformed to enable for a convenient automatic analysis of their outputs with respect to different input settings. For this work, the emphasis is on the randomness of the produced authentication tag. The resulting bitstreams (authentication tags) should be tested by standard statistical batteries (NIST STS, Dieharder or others) and by EACirc, a novel framework based on genetic programming and software circuit emulation. The results from different tools should be compared and contrasted with respect to used settings (number of tests, the amount of processed data, etc.) and outcome interpretation (claimed randomness conclusions).

References:

• CAESAR: Competition for Authenticated Encryption,
  http://competitions.cr.yp.to/caesar.html
• NIST STS: Statistical Test Suite by National Institute of Standards and Technology,
  http://csrc.nist.gov/groups/ST/toolkit/rng/documentation_software.html
• Dieharder: A Random Number Test Suite,
  https://www.phy.duke.edu/~rgb/General/dieharder.php
• EACirc: Framework for Automatic Problem Solving,
  https://github.com/crocs-muni/EACirc