engleski

Solving cryptographic primitives optimization problem using evolutionary computation algorithms

Examination of methods for evaluation of cryptographic primitives, with focus on AES S- box. Description of properties of S-boxes and Boolean functions, important for evaluation of AES S-boxes within the Evolutionary Computation Framework (ECF). Experiments description and results, using ECF and implemented algorithms – Roulette Wheel and Steady State Tournament. Comparison of the results given by Roulette Wheel and Steady State Tournament is given. As future work, it is proposed to build new evolutionary algorithm into ECF and try multi objective evolutionary algorithms for S-box optimization.

cryptographic primitives, evolutionary computation algorithm

nije evidentirano