Problems of cryptography as discrete optimization tasks

Abstract

In this contribution problems encountered in the field of cryptology, are introduced as discrete optimization tasks. Two evolutionary computation algorithms, namely the particle swarm optimization method and the differential evolution method, are applied to handle these problems. The results indicate that the dynamic of this type of discrete optimization problems makes it difficult for the methods to retain information.