Model of Encryption System with Genetic Algorithm
Martin Javurek, Michal Turčaník, Boris Matej · 2019
One of the security conditions of Vernam's cipher is that the encryption key must be greater than or equal to the open text we want to encrypt. At the same time, this key must not be repeated in another encryption. Then, each change of the encryption key adds security to the encryption process. If a cipher is changed several times while encrypting a single open text, it becomes very difficult to decrypt the message. Therefore, our goal will be to design a mechanism to generate an encryption key using a Tree Parity Machine and a Genetic Algorithm that will be able to create the same encryption keys on both sides that enter the encryption process. While these keys should change during encryption.