A new DNA strand-based encryption algorithm using symmetric key generation table

numbers. Simulation all all text (words) is executed in parallel by using Visual Basic programming, obtained an excellent encoding result in terms of time because all the characters, so the algorithm is able to process the largest number of data, all of them encode at the same time. An efficient, fast and highly encoding scheme has been obtained due to the complete executing parallelism of the DNA-based algorithm. © 2022 University of Al-Qadisiyah. All rights reserved.


Introduction
Initially, because of the great parallelization and excellent energy efficiency of Deoxyribonucleic DNA coding and the great density of information inherent in DNA molecules for data storage and coding, it is distinguished from other coding technologies. The DNA cryptography technique is a new encouraging path in cryptography science that has emerged as a result of advances in the field of DNA computing, the uses of DNA and RNA have multiple scientific applications within the field of DNA nanotechnology, as they have been used in optical computers [1,3] and in drugs that treat cancer [4], as well as their use in cryptography information because the world is witnessing an explosion of information in which The analysis of information has grown a very important mechanism source, and therefore the task of information field security is becoming increasingly important. cryptography is the most important part of telecom and computer security infrastructure [5]. Research continued in the science scope that related to cryptography field and steganography field using DNA in the past few years, in 2011 S. Jeevidha et.al. analyzed a proposal DNA computing approach with DNA depends cryptographic different approaches which produces the easy concept and constraints of all works that focus on this research [6] Z. Yunpeng et al., on the other hand, used simulation and theoretical research to demonstrate the algorithm's efficiency, biosecurity and math security are two examples. The used algorithm has a tremendous key space, plaintext has a high sensitivity, and encryption has a huge effect. In addition, the algorithm has been verified to work at the computing processing stage in the encryption security evaluation scheme [7]. After this offered innovative algorithm to communicate data securely by A. Atito et.al. in 2012. The Playfair-insertion the procedure is a construction encryption and data concealment applying some features of Deoxyribonucleic Acid (DNA) structure sequences [8]. DNA cryptography applies Hybridization of DNA oligonucleotides, and the generic binary one-time pad methodology was mixed in this paper. [9]. Digital DNA encoding, rules of complementary, and biotechnological designs in this scheme [10]. Using DNA sequences for the encoded text message is a means of transmitting information, a process to transfer encrypted data through a secure communication channel. The time complexity of transferring encrypted messages is reduced by the message transmission process. Biomolecular and one time-pad technologies is done for secure message encryption [11]. An algorithm computation security using DNA cryptography suggested. In wireless communication, DNA cryptography is combined with a safe support layer (SSL) to create a secure channel for a more secure information replacement [12]. Cascaded DNA cryptography and steganography which represent hiding of data. Initially it performs DNA cryptography and then its hidden in a random frame of video [13]. Kevin Santoso et al. described a section-based DNA steganalysis approach that stores binary information in non-coding regions of the Nucleotide sequence. The goal of sector-based compression is to protect the organism's life data while maintaining a high level of protection, data performance, and error checking. A sector is made up of referencing bases, segmentation message bases, and parity bases [14]. DNA Cryptography introduced after that in many method some these traditional such as genetic algorithm [15,16] and Vigenere Cipher [17], data Encryption Standard (DES), Advanced Encryption Standard (AES), and Blowfish are examples of symmetric cryptographic techniques [18], and asymmetric key cryptographic algorithms like Rivest-Shamir-Aldeman RSA [19], but other encryption based on biological technologies such as DNA chips and Polymerase Chain Reaction PCR amplification [20][21][22], DNA Encryption Dependent on DNA Arithmetic and Biomedical Processes is a strategy for encrypting DNA [23]. Bimolecular cryptography emerged as field for data encryption which exploiting specific biomolecular interactions as a unique approach for information security [24]. A novel algorithm to communicate data securely is suggested in this paper. The technique is a combination of encryption using properties of DNA sequences and generation matrix as key for decryption process. Consequentially, the presented method includes mainly of three levels. The first level, plaint text convert to binary sequences. While the second level the safe data is encrypted using a DNA, and the third level, the encrypted data is hidden by convert it into matrix of number. The submitted algorithm can successfully work on any text writing that represents in decimal and then binary data since it is transformed into a string of DNA nucleotides adopting the code of DNA.

Related work
A summarized analysis of some associated works is discussed in this section as following: Sirisha KS and Sheena Mathew [25] are merging cryptographic protocols and steganography techniques gave a new hybrid method that performs the device has multiple layers of authentication, including DNA-based Advanced Encryption Standard (AES) encryption. The Steganalysis schemes employed do not expand the original DNA sequence, and the encrypted data can be withdrawn without a real DNA known sequences. In this work, the proposed encryption algorithm depends on the mixture of the conception of DNA encryption and DNA dependent AES DNA steganography is combined with encryption. The DNA-RSA Hybrid Cryptographic system proposed by Narendren S et al [19] integrates different appropriate algorithms used in existing DNA cryptography algorithms with the RSA algorithm, leading in a DNA-RSA Hybrid Cryptographic algorithm. The hidden message is translated to DNA before being passed via a rounded function. Transcription, translation, mutation, reverse transcription, and circular right shift are among the activities performed by a round method. The round function's output (i.e., the DNA sequence) is then translated to binary number format, with the decimal value of the binary sequence serving as the hidden message for the RSA algorithm. The cipher text fragments are then estimated using RSA, and as all the blocks are merged into a unified cipher text. This mixed cipher text is first compiled to binary numbers, then to DNA. As a response, this DNA sequence will be the last cipher text used during the contact. Vidhya and Rathi Priya [26] suggested method composes from the steps as following, the first step being to apply the encryption key to the original text by encrypting it by that key, then take ASCII number for each letter after that convert all decimal number into corresponding binary numbers and finally convert each pair of binary number to DNA sequences. The sequence of DNA can be received by the receiver. Create a binary representation of the DNA sequence. Erase the suffix secret message afterward. Binary numbers are compared to ASCII numbers with an eightbit weight. The ASCII numbers are transferred to ASCII values, and when the shift key is held, the plaintext is viewed by the receiver. B. Devi Patnala and R. Kiran Kumar [27] offered a DNA-based defense algorithm based on DNA Codon groups. This scheme utilizes the exchange process, in which transformations are performed using a Lookup table is a collection DNA Codon groups and their corresponding alphabet values. This table has a random number generator and should be sent to the recipient via secure media. The main idea behind DNA molecules is that they can collect information for a long period of time. D.Ratna Kishore et. al [28] Because the key is generated at random, figuring out the plaintext is an unfathomable task for the intruder is presented. At first, both the transmitter and the recipient agree that the spiral pattern is correct. The sender's randomly generated key is sent to the receiver over the secure media. There are three levels of security in the proposed technique. XOR's cross join with the plaintext and the key, i.e., XOR(M1-K1), XOR(M2-K2), XOR(M3-K3), and XOR(M4-K4), is conducted at the primary level number. At the next level, the DNA sequence, which is four characters long, is mapped to a DNA ASCII value. Another DNA ASCII Table is being constructed with the goal of distinguishing the mapping in 256! distinct ways, increasing the complexity of the intruder's actions. The DNA string sequences are placed in a spiral form in the last level. The data is transmitted to the recipient in a row-byrow fashion. To provide a higher security framework, the proposed method increased the level of confusion and diffusion. Anupam Das et al. [29] presented a detailed report, and the information provided here will greatly assist researchers in doing further research in this area. The modules for degenerative changes, cryptography, and decryption must commission need subsequent work on cryptographic techniques deployment. The current work will also aid in the development and integration of DNA-based cryptography and steganography methodologies. Prasanna Balaji Narasingapuram and M. Ponnavaikko [30] devised and implemented a novel security method to strengthen the user's level of security It's a user authentication strategy for any network or cloud application that requires it. In a protected data transfer application, the user authentication procedure is one of the most critical and vital activities. It certifies if the user is acceptable or malevolent, and whether the user has access to the information.

Proposed algorithm
The suggested system produces a secure key as matrix in new manner which increases difficulty to break the code of plaint text. Suggested a new encryption approach is implemented depended on three levels to get the cipher text. The entire operation of DNA encoding, and decryption illustrated in the following Fig. 1.

Algorithm for encryption
Level one: The encryption procedure is viewed in the following stages as: 1: Input data (plaint-text) separates into n-words (number of words), each one encrypted by converting it into a corresponding number (decimal Form) for each character by using Level two: 1: Add padded zero in front all binary numbers, and each block 6bit in binary, considered as blocks. 2: After that, through using (2) bit binary coding law, every 2 bit is convertible to nucleotide bases (DNA bases). [28] as shown in Table2, we get n-strings of DNA bases sequences.  The table consists of three rows for each code belonging to a character where the first line represents the first base, so if the first base is Adenine A that is placed in the first column and if the first base is cytosine C it is placed in the second column, but if the base Guanine G placed in the third column and placed in the fourth column if they are Thymine T. And so on for the rest character codes as explain in Table 3. Therefore, the last form of cipher text as matrix all elements are two digits first is number that represent of row and the second is represented number of columns related to nitrogen base in each character code.

Algorithm for decryption
Analysis all number to corresponding nitrogen bases for each character code.
Convert the character code to binary code according Table2.
Delete the padded zero in front all binary numbers. Convert all binary numbers into decimal numbers Each number results from step 4 subtract from 25 and convert the result number into character by using Table 1. Encryption procedure is a numerical description representation as the following example: Input data using is "SYMMETRIC ALGORITHM", the operation steps is explained as following Table 3:

Level three:
After reaching a sequence of three nitrogen bases representing each letter in the second level of coding, we distribute those bases on a table in a way that each sequence is built of three rows in each column from four columns, three bars representing the number of nitrogen bases for a minimum obtained from the last stage, and four columns representing all the possibilities of the bases Probable nitrogenous be any resulting sequence (A, C, G, T). The encrypted words are taken at the same time and the rules are entered into a table where we notice for each rule three lines for each word. The A was placed in the first row of the A column of the first word while T was placed in the second row of the T column of the first word and the base G was placed in the third row of the first word's G column, and so on for the rest. We put each nitrogen base in its place based on Table 4.     Table 4, we take a two number, the first represent the number of rows, and the second number of columns, after that delete all numbers represent row number and get the following n-array, in each one the number of columns represents the number of characters in each word as shown in Table 5 which represent cipher text. Decryption: Analysis of all numbers to corresponding nitrogen bases for each character code. Then convert the character code to binary code according to Table2. After that delete the padded zero in front of all binary numbers, next step is converting all binary numbers into decimal numbers. Finally, each number results from step 4 subtract from 25, and convert the resulting number into character by using Table 1. Back each number in cipher text to row number, then retrieve to nitrogen base equivalent to pair number, after that convert it into binary code as Table 5.

Discussion and simulation results
In most of the research like this work, it goes through almost the same procedures, which is to convert the data into an ASCII code, then into a binary digital system, and finally get the code represented by a series of nitrogenous bases, or convert each number to a specific amino acid, and thus the encoding and decoding path is known in advance. As for the proposed work, there was a change in the encryption and decryption procedures, which is a departure from the norm by implementing the mentioned steps. This added advantages to the work where the path is safe for decryption. Also, relying on a table that can be read and written in an accurate manner recognized by the sender and the recipient, and provided a level of sobriety for the algorithm, in addition to that. It is possible to implement in a parallel way a full text and not just words, making a change in the efficiency of obtaining the largest amount of secure information. The implementation of the algorithm for encoding and decoding is by an easy and parallel mechanism, which supports an efficient system capable of executing an unlimited number of words. In this paper, we take an example consisting of two words as shown in Fig.  2, simulation part of encryption process for plaint text "SYMMETRIC ALGORITHM". While Fig. 3, is shown simulation part of decryption process.

Conclusion
In recent years, many papers have focused on research into DNA encoding. DNA encoding has a huge data capacity in addition to the possibility of parallel implementation of represent and giving a high confidentiality of data that made it the focus of attention of researchers.
In this work, we presented a model for an algorithm consisting of two dimensions: the first dimension is data encryption, which includes three levels, respectively, while the other dimension is decryption, which consists of five steps. A table has been added at the end of the encryption process and the beginning of the decryption process to serve as a strong security barrier to prevent tampering or obtaining the text by the eavesdropper of the process. It is noteworthy, we added DNA with this research in a new way that opens horizons to apply that within other asymmetric algorithms or even the ability to implement quantum cryptography by employing DNA strands that can be Polarized lightbearing bodies, such as chromo-pores.