DNA COMPUTING

A PROJECT REPORT

Submitted by

NANDHA KISHORE R
(2018272031)
A report for the Technical Seminar and Report Writing Of The Project
submitted to the Faculty of

INFORMATION AND COMMUNICATION ENGINEERING

in partial fulfillment
for the award of the degree
of

MASTER OF COMPUTER APPLICATION

DEPARTMENT OF INFORMATION SCIENCE AND TECHNOLOGY

COLLEGE OF ENGINEERING, GUINDY
ANNA UNIVERSITY
CHENNAI 600 025

APRIL 2020
 ii

ANNA UNIVERSITY
CHENNAI - 600 025
BONA FIDE CERTIFICATE

Certified that this project report titled DNA COMPUTING is the

bona fide work of NANDHA KISHORE R who carried out project work under
my supervision. Certified further that to the best of my knowledge and belief,
the work reported herein does not form part of any other thesis or dissertation
on the basis of which a degree or an award was conferred on an earlier occasion
on this or any other candidate.

PLACE: <PROJECT GUIDE>

DATE: <DESIGNATION>
PROJECT GUIDE
DEPARTMENT OF IST, CEG
ANNA UNIVERSITY
CHENNAI 600025

COUNTERSIGNED

Dr. SASWATI MUKHERJEE

HEAD OF THE DEPARTMENT
DEPARTMENT OF INFORMATION SCIENCE AND TECHNOLOGY
COLLEGE OF ENGINEERING, GUINDY
ANNA UNIVERSITY
CHENNAI 600025
 iii

ABSTRACT

DNA Cryptography is one of the latest research methods in the field

of cryptography. DNA can be used to encrypt and transfer data in the form of
storage and it also performs the computation. The principal function in DNA
cryptography is to construct a sequence of DNA. The sequence of DNA is
generated using the information carrier and the biological technology. The main
purpose of this system is to make the DNA sequence more complex. The main
purpose of this paper is to offer high-security data. The proposed work offers
two levels of protection. The first step is to turn the plain text with the shift
key into an ASCII text, and then convert the text into a binary number.Apply
the method of insertion to binary numbers; convert the binary numbers to the
DNA sequence that is represented as cipher. To cipher text the plain text will
appear, the receiver must apply the Insertion decryption process.The Shannon
entropy is used to measure the data compression and the time complexity is used
to measure the execution time of the proposed work.
 iv

ACKNOWLEDGEMENT

I have taken efforts in this project. However, it would not have been
possible without the kind support and help of many individuals and organizations.
I would like to extend my sincere thanks to all of them.

I am highly indebted to all for their guidance and constant supervision

as well as for providing necessary information regarding the project also for
their support in completing the project.

I would like to express my gratitude towards my parents member of

College of Engineering, Guindy for their kind co-operation and encouragement
which help me in completion of this project. I would like to express my special
gratitude and thanks to industry persons for giving me such attention and time.
My thanks and appreciations also go to my colleague in developing the project
and people who have willingly helped me out with their abilities.
 v

TABLE OF CONTENTS

ABSTRACT iii
LIST OF FIGURES vi
LIST OF SYMBOLS AND ABBREVIATIONS vii

1 INTRODUCTION 1
1.1 DATA ENCRYPTION 2
1.2 DNA CRYPTOGRAPHY 3
1.3 PROBLEM STATEMENT 4
1.4 CHALLENGES 5
1.4.1 Quantum Computing 5
1.4.2 DNA Computing 5
1.4.3 Secure Channels 5
1.4.4 Cryptographic Algorithms Limitations 6
1.5 ORGANIZATION REPORT 6

2 LITERATURE SURVEY 7
2.1 NOVEL ALGORITHM FOR DATA ENCRYPTION 7
2.2 DNA BASED ENCRYPTION METHOD 8
2.3 CONCLUSION 8

3 SYSTEM DESIGN 9
3.1 ARCHITECTURE OF THE SYSTEM 9

4 ALGORITHMS 10
4.1 ENCRYPTION ALGORITHM FOR DNA CRYPTOGRAPHY: 10
4.2 DECRYPTION ALGORITHM FOR DNA CRYPTOGRAPHY: 11

5 IMPLEMENTATION AND PERFORMANCE ANALYSIS 12

6 CONCLUSION AND FUTURE WORK 17

REFERENCES 18
 vi

LIST OF FIGURES

1.1 Structure Of DNA 4

3.1 System Design Of Two Level Encryption 9

 vii

LIST OF ABBREVIATIONS

DNA Deoxyribo Nucleic Acid

DES Data Encryption Standard
ASCII American Standard code for Information Interchange
 1

CHAPTER 1

INTRODUCTION

As some of the modern cryptographic algorithms (such as DES, and

recently, MD5) are broken, new directions of information security are being
required to protect the data. The concept of using DNA computing in the field
of computer security is a possible technology that may bring forward a new hope
for powerful or even unbreakable cryptography algorithms.In his pioneering
work, Adleman build the base for the new field of biomolecular research.The
main idea was to use actual chemistry to solve problems that are either require
enormous amount of computation or unsolvable by conventional computers.This
approach has been extended by Lipton to solve another NP-complete problem
which is the satisfaction problem.These opened a new way of solving many
problems in different fields, including cryptography.The main advantage behind
the DNA molecular structure is its vast parallelism,exceptional energy efficiency
and extra- ordinary storage capacity.One gram of DNA can store about 108
tera bytes. But in spite of showing bright future towards cryptography, it is
confronted with some drawbacks such as requirement of huge computing time,
high computation complexity and high tech biomolecular laboratory.In general,
existing cryptography techniques use modern biological technologies as tool
and DNA as information carrier. These biological technologies include PCR
amplification, synthesizing message DNA strands, hybridization etc.The method
which are mentioned above are costly, complex and need enormous amount of
time.The research of DNA cryptography is still at its initial stage, and there are
many problems yet to be solved.
 2

1.1 DATA ENCRYPTION

Data encryption is a process to encrypt the data from one form to

another form. This data is called an encrypted data. The encrypted data is
mainly called as a cipher text. The original data is called as an plaintext.The
purpose of data encryption is to protect digital data confidentiality as it is stored
on computer systems and transmitted using the internet or other networks. The
outdated data encryption standard (DES) has been replaced by modern encryption
algorithms that play a critical role in the security of Information Technology
systems and communications. The data encryption contains two types. They are
asymmetric encryption, also known as public-key encryption, and symmetric
encryption.In Data encryption the basic operation is a string operation. The
substitution method is one of the basic methods in string operation.

For example the plaintext string is traverse and each character is

replaced by some other character according to a fixed rule.The Caesar cipher
scheme is one of the basic process in data encryption process to create the cipher
text. The caser cipher process is to replacing each letter one by one the letter
that appears k positions later in the alphabet for some integer k.

For example, using the character set A B C D E F G H I J K L M N O P Q

R S T U V W X Y Z.

Encrypt the string “MARCH” with integer k has value 3:

Character set:A B C D E F G H I J K L M N O P Q R S T U V W X Y
Z.

Plaintext: MARCH Cipher text: PDUFK

 3

1.2 DNA CRYPTOGRAPHY

DNA cryptography is a new born cryptography technique in which

DNA is used as information carrier and the modern biological technology is
used as implementation tool. The vast parallelism and extra ordinary information
density that are inherent in DNA molecules are explored for all sorts of techniques.

Now a days, the field of biology and that of cryptography have come
to combine. The study of DNA can be applied in DNA cryptography systems
that are based on DNA and one- time-pads, and if It is used correctly, it is
virtually impossible to crack the system.

DNA computation is high level computation and storing huge amount

of data. A single DNA gram contains 1021 DNA base which is equal to 108
terabytes of data.In Figure.1.1 shows the DNA structure which contains an four
bases that are Adenine(A), Thymine(T), Cytosine(C) and Guanine(G).Let us
assume that the data has been encrypt in the form of A, G, C ,T with the
combination of 0’s and 1’s shown in the table 1.

Table 1. DNA Binary Conversion

DNA BASE BINARY VALUE

A 00
G 01
C 10
T 11
 4

Figure 1.1: Structure Of DNA

1.3 PROBLEM STATEMENT

There are various modern techniques of cryptography which ensures

the four security attributes for security are namely:Availability,Confidentiality,
Integrity, Authenticity. But there are memory and computational issues with
these techniques.To overcome these issues, DNA computing techniques has
been developed. These techniques are very efficient as they provide huge memory
and parallel computing of DNA. Keeping in mind these facts, the project has
been carried out.The complexity is low in Existing System. The security level
of the DNA Cryptography is low in Existing System. The proposed system
provides two levels of security.
 5

1.4 CHALLENGES

The more progress in information technology the more challenges

it will confront by the mean of insurance, integrity, and security as most of
the currently used cryptographic schemes are rely on computational hardness
assumptions that cannot keep up with the rapid progress on the information
technology development pace.

1.4.1 Quantum Computing

Quantum Computing: The pace the scientists keep minimizing the

transistor size on a silicon chip of a classical computer one day will reach
its limit. Quantum Computing may be a replacement. Quantum computers
could use quantum bits called qubit by using a single electron instead of digital
circuits; it differs that the qubit does not have to be in an exact position, that
is called Quantum superposition, the same qubit may be zero, one, any value
between zero and one managed by quantum mechanics. The quantum computing
is not faster than the classical computer but the key advantage is in the parallelism
as each qubit can calculate multiple calculations, in addition to the size of one
transistor on a quantum computer can be like the size of one atom. Quantum
Computing is one of the threats that undermine the existence nowadays algorithm,
although we are far away from a real implementation.

1.4.2 DNA Computing

DNA Computing: DNA Computing takes advantage of parallelism

embedded in its molecules to try different possibilities at once. If a DNA
computer can be realized in a real-world implementation, it can be faster and
smaller than any other computer built so far. For instance, the prime factorization
problem seems to be realized in an affordable time using a molecular computer.
 6

1.4.3 Secure Channels

Secure Channels: There is no secure channel in the real world, but

there is at best condition to make insecure channel less insecure. Secure channels
are a way to prevent intruders to overhearing or tampering. Confidential channels
prevent overhearing but not tampering, and Authentic Channels prevent tampering
but not overhearing.

1.4.4 Cryptographic Algorithms Limitations

Cryptographic Algorithms Limitations: Cryptography, in general, is

standard procedure with different keys for each encryption process making the
attacker focuses only on one variable which is guessing the key used in the
algorithm.

1.5 ORGANIZATION REPORT

Chapter 2: This chapter explains about the literature survey made on the existing
system.
Chapter 3: This chapter explains the architecture of the system.
Chapter 4: This chapter explains about the algorithms of the system.
Chapter 5: This chapter explains about the Implementation and performance
analysis of the system.
Chapter 6: This chapter gives the conclusion on the proposed system and what
future work is to be done.
 7

CHAPTER 2

LITERATURE SURVEY

This chapter explains about the literature survey made on the existing
system, analyzing the problem statements and issues with the existing system
and proposed objectives for the new system.

2.1 NOVEL ALGORITHM FOR DATA ENCRYPTION

Prashanth Mogali and Neha Kaura stated a novel symmetric text

cipher algorithm based on chaos; they use a 128 bit secret key, two logistic maps
with optimized pseudorandom sequences, plain text characteristics, and only
one permutation and diffusions round. Several security analysis are presented as
secret key size, secret key sensitivity, frequency with histograms, auto correlation
analysis, information entropy analysis, differential analysis, attacks analysis,
and encryption/decryption time.The method implemented at two main levels:
first a DNA-based play-fair cipher is applied to encrypt the message. The second
level uses a two-by-two generic complementary substitution rule to replace the
reference to the encrypted DNA. A performance analysis was presented on the
hiding capacity as well as robustness against attacks. The proposed technique
was tested on different real DNA sequences considering a number of parameters
such as time performance and capacity. In conclusion, the proposed scheme can
encrypt information into DNA sequences in addition to hiding these data into
another reference DNA sequence increasing the security level. chosen/known
plain text attack; therefore, it can be implemented in real-time applications.DNA
cryptography research is fully depth on DNA computing. In this paper cost and
complexity is higher for securing the data.
 8

2.2 DNA BASED ENCRYPTION METHOD

H.Z.Hsu and R.C.T.Lee stated that the DNA sequences possess some
interesting properties which we can utilize to encrypt data. We presented three
methods, the insertion method, complementary pair method and the substitution
method. For each method, we secretly select a reference DNA sequence S and
incorporate the secret message M into it such that we obtain S’. We send this
S’, together with many other DNA, or DNA-like sequences to the receiver.
The receiver is able to identify the particular sequence with M hidden in it
and ignore all of the other sequences. He will also be able to extract M.The
proposed method consists of three level of security for encryption of data. In
Level-1 the shift key operation and complement operations are used. In level-2
the LBP operator is applied on the output of shift key and one’s complements
operation. In level-3 the output of two level is converted into DNA sequence.
The receiver will apply the decryption for extracting the plain text from the
cipher text. This proposed DNA cryptography provides the better security than
the other cryptographic techniques and also takes less time for encryption and
decryption of the data and provides more security.In this paper DNA sequences
is used to encrypt data with a three methods.

2.3 CONCLUSION

From the above study, it is observed that three level encryption is

used very frequently. But in this work, the two level encryption techniques is
proposed to achieve better accuracy with in shorter execution time.
 9

CHAPTER 3

SYSTEM DESIGN

3.1 ARCHITECTURE OF THE SYSTEM

The following Figure 3.1 shows the system design in which sender
is sending the information to the receiver, Encryption is done in two levels.In
first level,shift text is converted to ASCII value ,Then ASCII values converted
to binary numbers. In second level encryption,apply the insertion encryption
mathod and send the cipher text.The receiver is receiving the key from sender;
the receiver uses this key to get the original message. The cipher text is unreadable
after the encryption; we can read the text by using the key to convert cipher text
to original message.In decryption,Replace the received text with DNA sequence
by applying Insertion Decryption Method. Convert the DNA sequence into
binary numbers by using the DNA binary conversion table. Convert the binary
values into correspondent ASCII values with an segment of 8.The cipher text
should be sent in Secured channel.

Figure 3.1: System Design Of Two Level Encryption

 10

CHAPTER 4

ALGORITHMS

This chapter explains about the algorithms for proposed system, The
first level is to transform the plain text to an ASCII text with the shift key and
then convert the text to a binary numbers. Apply the insertion method to binary
numbers; convert the binary numbers to DNA sequence which is represented as
cipher text. The receiver will apply the Insertion decryption method to cipher
text the plaintext will appear.

4.1 ENCRYPTION ALGORITHM FOR DNA CRYPTOGRAPHY:

Input: Plaintext S.
Output: Cipher text S’.

First Level

Step 1:Input the plaintext and shift the plaintext by using key (k1) of any length.

Step 2:Convert the shift text to the ASCII values.

Step 3:ASCII values can be convert to a binary numbers.

Second Level

Step 4:Apply the Insertion Encryption method to binary numbers and

Step 5:Create DNA Sequence with the DNA conversion table.

Step 6:Return Cipher text.

 11

4.2 DECRYPTION ALGORITHM FOR DNA CRYPTOGRAPHY:

Input:Cipher text S’.

Output:Plaintext S.

Step 1:Replace the received text with DNA sequence by applying Insertion
Decryption Method.

Step 2:Convert the DNA sequence into binary numbers by using the DNA
binary conversion table.

Step 3:Convert the binary values into correspondent ASCII values with
an segment of 8.

Step 4:Shift the ASCII values with the key length of (k1).

Step 5:Return Plaintext.

 12

CHAPTER 5

IMPLEMENTATION AND PERFORMANCE

ANALYSIS

This chapter will provide implementation details of proposed system

and performance analysis can be done by calculating execution time.
Encryption process:
First Level Encryption
Plaintext : CRYPTOGRAPHY.
Shift key : 5
Shift text : HWDUYTLWFUMD

Table 2. Conversion table of ASCII character to DNA sequence.

SHIFT TEXT ASCII VALUE BINARY VALUES SEGMENT SEQUENC
H 72 01001000 ’01’, ’00’, ’10’, ’00’ GACA
W 87 01010111 ’01’, ’01’, ’01’, ’11’ GGGT
D 68 01000100 ’01’, ’00’, ’01’, ’00’ GAGA
U 85 01010101 ’01’, ’01’, ’01’, ’01’ GGGG
Y 89 01011001 ’01’, ’01’, ’10’, ’01’ GGGG
T 84 01010100 ’01’, ’01’, ’01’, ’00’ GGGA
L 76 01001100 ’01’, ’00’, ’11’, ’00’ GATA
W 87 01010111 ’01’, ’01’, ’01’, ’11’ GGGT
F 70 01000110 ’01’, ’00’, ’01’, ’10’ GAGC
U 85 01010101 ’01’, ’01’, ’01’, ’01’ GGGG
M 77 01001101 ’01’, ’00’, ’11’, ’01’ GATG
D 68 01000100 ’01’, ’00’, ’01’, ’00’ GAGA
 13

Concatenate the binary values segment

[’01’, ’00’, ’10’, ’00’, ’01’, ’01’, ’01’, ’11’, ’01’, ’00’, ’01’, ’00’, ’01’, ’01’,
’01’, ’01’, ’01’, ’01’, ’10’, ’01’, ’01’, ’01’, ’01’, ’00’, ’01’,’00’, ’11’, ’00’, ’01’,
’01’, ’01’, ’11’, ’01’, ’00’, ’01’, ’10’, ’01’, ’01’, ’01’, ’01’, ’01’, ’00’, ’11’,
’01’, ’01’, ’00’, ’01’, ’00’]
Second Level Encryption
message:[’1010000101010101’] - [’1’, ’0’, ’1’, ’0’, ’0’, ’0’, ’0’, ’1’, ’0’, ’1’,
’0’, ’1’, ’0’, ’1’, ’0’, ’1’]
Bits for segmentation: 3
[’010’, ’010’, ’000’, ’101’, ’011’, ’101’, ’000’, ’100’, ’010’, ’101’, ’010’, ’101’,
’100’, ’101’, ’010’, ’100’, ’010’, ’011’, ’000’, ’101’, ’011’, ’101’, ’000’, ’110’,
’010’, ’101’, ’010’, ’100’, ’110’, ’101’, ’000’, ’100’]
Add the secret message to binary values segment
[0101, 0100, 0001, 1010, 0110, 1010, 0000, 1001, 0100, 1011, 0100, 1011,
1000, 1011, 0100, 1001, 0101, 0110, 0001, 1010, 0110, 1010, 0000, 1101,
0100, 1011, 0100, 1001, 1100, 1011, 0000, 1001]
Segmentation above binary values to two
[’01’, ’01’, ’01’, ’00’, ’00’, ’01’, ’10’, ’10’, ’01’, ’10’, ’10’, ’10’, ’00’, ’00’,
’10’, ’01’, ’01’, ’00’, ’10’, ’11’, ’01’, ’00’, ’10’, ’11’, ’10’, ’00’, ’10’, ’11’,
’01’, ’00’, ’10’, ’01’, ’01’, ’01’, ’01’, ’10’, ’00’, ’01’, ’10’, ’10’, ’01’, ’10’,
’10’, ’10’, ’00’, ’00’, ’11’, ’01’, ’01’, ’00’, ’10’, ’11’, ’01’, ’00’, ’10’, ’01’,
’11’, ’00’, ’10’, ’11’, ’00’, ’00’, ’10’, ’01’]
Cipher text
GGGAAGCCGCCCAACGGACTGACTCACTGACGGGGCAG
CCGCCCAATGGACTGACGTACTAACG
 14

Decryption process:
Receive the cipher text
[GGGAAGCCGCCCAACGGACTGACTCACTGACGGGGCAG
CCGCCCAATGGACTGACGTACTAACG
Cipher text to binary values based on DNA conversion table (Table 1)
[’01’, ’01’, ’01’, ’00’, ’00’, ’01’, ’10’, ’10’, ’01’, ’10’, ’10’, ’10’, ’00’, ’00’,
’10’, ’01’, ’01’, ’00’, ’10’, ’11’, ’01’, ’00’, ’10’, ’11’, ’10’, ’00’, ’10’, ’11’,
’01’, ’00’, ’10’, ’01’, ’01’, ’01’, ’01’, ’10’, ’00’, ’01’, ’10’, ’10’, ’01’, ’10’,
’10’, ’10’, ’00’, ’00’, ’11’, ’01’, ’01’, ’00’, ’10’, ’11’, ’01’, ’00’, ’10’, ’01’,
’11’, ’00’, ’10’, ’11’, ’00’, ’00’, ’10’, ’01’]
Concatenate the above values
010101000001101001101010000010010100101
101001011100010110100100101010110000110100110101000001
10101001011010010011100101100001001
Bits for segmentation: 3
[’0101’, ’0100’, ’0001’, ’1010’, ’0110’, ’1010’, ’0000’, ’1001’, ’0100’, ’1011’,
’0100’, ’1011’, ’1000’, ’1011’, ’0100’, ’1001’, ’0101’, ’0110’, ’0001’, ’1010’,
’0110’, ’1010’, ’0000’, ’1101’, ’0100’, ’1011’, ’0100’, ’1001’, ’1100’, ’1011’,
’0000’, ’1001’]
Remove the secret message
[’010’, ’010’, ’000’, ’101’, ’011’, ’101’, ’000’, ’100’, ’010’, ’101’, ’010’, ’101’,
’100’, ’101’, ’010’, ’100’, ’010’, ’011’, ’000’, ’101’, ’011’, ’101’, ’000’, ’110’,
’010’, ’101’, ’010’, ’100’, ’110’, ’101’, ’000’, ’100’]
Concatenate
[’01001000010101110100010001010101010110010101
010001001100010101110100011001010101010011010100 0100’]
 15

Segment by two bits

[’01’, ’00’, ’10’, ’00’, ’01’, ’01’, ’01’, ’11’, ’01’, ’00’, ’01’, ’00’, ’01’, ’01’,
’01’, ’01’, ’01’, ’01’, ’10’, ’01’, ’01’, ’01’, ’01’, ’00’, ’01’, ’00’, ’11’, ’00’,
’01’, ’01’, ’01’, ’11’, ’01’, ’00’, ’01’, ’10’, ’01’, ’01’, ’01’, ’01’, ’01’, ’00’,
’11’, ’01’, ’01’, ’00’, ’01’, ’00’]
Convert to DNA sequence based on DNA Conversion Table (Table 1)
[’G’, ’A’, ’C’, ’A’, ’G’, ’G’, ’G’, ’T’, ’G’, ’A’, ’G’, ’A’, ’G’, ’G’, ’G’, ’G’, ’G’,
’G’, ’C’, ’G’, ’G’, ’G’, ’G’, ’A’, ’G’, ’A’, ’T’, ’A’, ’G’, ’G’, ’G’, ’T’, ’G’, ’A’,
’G’, ’C’, ’G’, ’G’, ’G’, ’G’, ’G’, ’A’, ’T’, ’G’, ’G’, ’A’, ’G’, ’A’]
Convert DNA Sequence to Binary values
[’01’, ’00’, ’10’, ’00’, ’01’, ’01’, ’01’, ’11’, ’01’, ’00’, ’01’, ’00’, ’01’, ’01’,
’01’, ’01’, ’01’, ’01’, ’10’, ’01’, ’01’, ’01’, ’01’, ’00’, ’01’, ’00’, ’11’, ’00’,
’01’, ’01’, ’01’, ’11’, ’01’, ’00’, ’01’, ’10’, ’01’, ’01’, ’01’, ’01’, ’01’, ’00’,
’11’, ’01’, ’01’, ’00’, ’01’, ’00’]
Segment the binary values eight bit
[[’01’, ’00’, ’10’, ’00’], [’01’, ’01’, ’01’, ’11’], [’01’, ’00’, ’01’, ’00’], [’01’,
’01’, ’01’, ’01’], [’01’, ’01’, ’10’, ’01’], [’01’, ’01’, ’01’, ’00’], [’01’, ’00’,
’11’, ’00’], [’01’, ’01’, ’01’, ’11’], [’01’, ’00’, ’01’, ’10’], [’01’, ’01’, ’01’,
’01’], [’01’, ’00’, ’11’, ’01’], [’01’, ’00’, ’01’, ’00’]]
Join every eight bits
[[’01001000’], [’01010111’], [’01000100’], [’01010101’], [’01011001’], [’01010100’],
[’01001100’], [’01010111’], [’01000110’], [’01010101’], [’01001101’], [’01000100’]]
 16

Performance Analysis

In proposed system the execution time are calculated based on the

number of characters which are presented in Table 3. The characters are increased
the execution time also increased.

Table 3.Execution Time Complexity

DNA BASE BINARY VALUE

3 2.37
101 3.86
482 4.93
961 6.52
608 6.04
1448 7.46
1809 9.34
 17

CHAPTER 6

CONCLUSION AND FUTURE WORK

The data security plays a vital role in the many places. Large numbers
of data are occurred every day but the data security level is low. The main
contribution of this paper is to improve the data security level to high by using
DNA cryptography with insertion method. The proposed work is to encrypt the
data with a DNA sequence and with an Insertion method. It is difficult for an
attacker to achieve the original data. If the DNA sequence is known by any of
the attacker, it is impossible to get correctly decrypted the data without knowing
about the Insertion method secret message. This proposed work is to secure the
text data with a high level security by the measure of data compression values.
In future the proposed work is applied to a different types of data like an image,
video, audio and soon.
 18
REFERENCES

[1] E Vidhya and R Rathipriya. Two level text data encryption using dna
cryptography. ”, International Journal of Computational Intelligence and
Informatics, 8:106–118, 2018.
[2] L M Adleman. Molecular computation of solutions to combinatorial
problems. 266:1021–1025, 1994.