The proposed algorithm is based on operators used in Genetic Algorithms (GA), adapted to encrypt and decrypt text.The principles of GA were exposed by Holland in 1975 [8], and described more broadly by Goldberg in 1989 [9], Poli, Langdon, McPhee, Michelle and Davis [23].The main limitation at the time of the creation of a cryptographic algorithm is the idea of innovation, since, currently, there are large amounts of algorithms of this type.With this motivation and in order to generate an original proposal, we decided to take advantage of GA techniques in cryptographic development, making some modifications without neglecting its philosophy.These alterations arise from the interest of creating a different work, which through a clear exemplification demonstrates that it is possible to create developments in the area of computer security using basic concepts.Our work takes the randomness and the order of operation of the genetic phases to arrive at a deterministic development, proposing in addition the use of two keys (auxiliary and main) without ceasing to be a symmetric algorithm. II. Theoretical Background A. Genetic AlgorithmsThe Genetic Algorithms are an adaptive method used to solve search and optimization problems, inspired by biological evolution