Genetic Operators Applied to Symmetric Cryptography

Abstract

In this article, a symmetric-key cryptographic algorithm for text is proposed, which applies Genetic Algorithms philosophy, entropy and modular arithmetic. An experimental methodology is used over a deterministic system, which redistributes and modifies the parameters and phases of the genetic algorithm that directly affect its behavior, carrying out a constant evaluation using the fitness function, in order to optimize the results. An independent encryption is established for the auxiliary key, using a main key, in charge of increasing security. The tests are performed over different text sizes, manipulating the parameters and criteria proposed to obtain their appropriate values. Finally, a comparison is presented against the following cryptographic algorithms DES (Data Encryption Standard), RSA (Rivest, Shamir and Adleman) and AES (Advanced Encryption Standard), exposing factors such as processing time, scalability, key size, etc. It is shown that the proposed algorithm has a better performance.