Thesis Details
Evoluční návrh booleovských funkcí pro kryptografii
The goal of this bachelor's thesis is to compare various selection methods used in cartesian genetic programming applied to a problem of various types of cryptographically significant boolean functions. I focused on these selection methods: evolutionary strategies (1+lambda) and (1,lambda), tournament selection and roulette selection. The chosen problem was solved by an implementation of CGP with the above-mentioned selection methods and by a statistical evaluation of data acquired from conducted experiments. Evaluation of mentioned data has shown that the best results in case of bent functions were achieved while using (1+lambda) evolutionary strategy. The roulette selection performed the best in case of balanced functions with high nonlinearity.
Bent functions, Balanced functions with high nonlinearity, Cartesian genetic programming, Evolutionary strategy, Tournament selection, Roulette selection
Chudý Peter, doc. Ing., Ph.D. MBA (DCGM FIT BUT), člen
Kekely Lukáš, Ing., Ph.D. (DCSY FIT BUT), člen
Strnadel Josef, Ing., Ph.D. (DCSY FIT BUT), člen
Trchalík Roman, Mgr., Ph.D. (DIFS FIT BUT), člen
@bachelorsthesis{FITBT21572, author = "Jan Dvo\v{r}\'{a}k", type = "Bachelor's thesis", title = "Evolu\v{c}n\'{i} n\'{a}vrh booleovsk\'{y}ch funkc\'{i} pro kryptografii", school = "Brno University of Technology, Faculty of Information Technology", year = 2019, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/21572/" }