1

DNA COMPUTING
NANDHA KISHORE R
2018272031
 2
Abstract

DNA Cryptography is one of new method in the cryptography

research area. The proposed system provides two levels of security. The main target is
to increase the complexity and high security level of the DNA sequence. The time
complexity is used to measure the execution time of the proposed system.
 3
Introduction

• DNA Computing is one Research area that is growing fast since DNA molecules are
implemented in a computational process.

• DNA cryptography is one of the new fields to encrypt the data.

• One gram of DNA can store about 10^8 terabytes.

• the data has been encrypt in the form of A, G, C ,T with the combination of 0’s and
1’s
 4
Problem Statement

• The security level of the DNA Cryptography is low in Existing System.

• The complexity of the DNA Cryptography is low in Existing System.
• The proposed system provides two levels of security.
 5
Challenges

• To Increase the security level of DNA Cryptography.

• To Increase the complexity of DNA Cryptography.

• Difficulties of DNA cryptography are the requirement of high tech bio molecular
laboratory and computational complexity.
 6
Literature Survey
Author Year Paper Title Description
Prashanth Mogali and 2016 Novel algorithm for data DNA cryptography
Neha Kaura encryption research is fully depth on
DNA computing. In this
paper cost and complexity
is higher for securing the
data.

H. Z. Hsu and R. C. 2014 DNA based encryption DNA sequences is used to

T. Lee methods. encrypt data with a three
methods.
 7
Existing System

• Kritika Gupta and Shailendra Singh Projected a DNA Based Cryptological

Techniques for an encryption algorithm based on OTP (one-time-pad) that involve
data encryption using traditional mathematical operations and/or data manipulating
DNA techniques.

• Cheng Guo, Shiu Proposed the hiding procedure substitutes another letter

for an existing letter on a special location set by the algorithm.

 8
Proposed System

DeoxyriboNucleic Acid (DNA)

• DNA is a double helical structure with two

strands running anti parallel .
• DNA consists of four bases of nucleic acid-A,G,C,T.

• A can connect only with T and C can connect only

with G. This process is called Hybridization
 9
Proposed System

• Proposed system provides two levels of security.

• 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.
 10
System Architecture
 11
Implementation

ALGORITHM FOR ENCRYPTION

• Input: Plaintext S.
• Output: Cipher text S’.
First Level
• Input the plaintext and shift the plaintext by using key (k1) of any length.
• Convert the shift text to the ASCII values.
• ASCII values can be convert to a binary numbers.
Second Level
• Apply the Insertion Encryption method to binary numbers and create DNA Sequence with the
DNA conversion table.
• Return Cipher text.
 12
Implementation

ALGORITHM FOR DECRYPTION

• Input: Cipher text S’.
• Output: Plaintext S.
• 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.
• Shift the ASCII values with the key length of (k1).
• Return Plaintext.
 13
Performance Analysis

Text in Characters Execution Time in Milliseconds(m/s)

3 2.37

101 3.86

482 4.93

931 6.52

601 6.04

1448 7.46

1446 7.09

1809 9.34
 14
Conclusion

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 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 data without knowing about the
Insertion method secret message. In future the proposed work is applied to a different
types of data like an image, video, audio and soon.
 15
References

• L.M.Adleman,“Molecular computation of solutions to combinatorial

problems”, Science, JSTOR, vol. 266, pp. 1021-1025, 1994.

• E. Vidhya, R. Rathipriya “Two Level Text Data Encryption using DNA

Cryptography”, International Journal of Computational Intelligence and
Informatics,Vol8:No.3,December2018.