KEY GENERATION USING GENETIC ALGORTHM FOR DNA PLAYFAIR CRYPTOSYSTEM

Abstract

One kind of encryption that makes use of DNA to encode and decode data is called "DNA cryptography." DNA sequences, with their peculiar arrangement of information, may be used to easily apply security measures for sensitive data. Though much has been studied and numerous algorithms have been created for concealing the data, DNA sequence based data encryption seems to be an efficient option for addressing the existing information security demands. The work applies the classic Playfair cipher to DNA cryptography. There are 26 different alphabets, however only 25 are used in the key matrix of a standard matrix since the key matrix is only 5 by 5. In this study, we employ genetic algorithms to produce the key, and an 8x8 key matrix containing 64 DNA codons to increase security. Although the encryption method has been improved, it still follows some of the fundamental principles of the original Playfair Algorithm. To address these issues and strengthen the security of the Playfair method, the DNA codons are rearranged into an 8x8 matrix. The suggested approach is time-effective since it makes use of a LOOKUP table with 64 possible values (A..Z, a..z, 0..9, etc). Additionally, each transmission has a unique LOOKUP table arrangement. We implement the suggested approach and compare its runtime complexity to that of several well-known ciphers. To that end, this paper's primary contribution is a DNA-based security mechanism.