DNA algorithm

Encryption and Decryption using DNA Sequence

The major issue of resource sharing in the cloud computing environment is data confidentiality. In order to protect data through the unsecure networks like the Internet, using various types of data protection is necessary. One of the famous ways to protect data through the Internet is data hiding. Because of the increasing number of Internet users, utilizing data hiding technique is inevitable. Eliminating the role of the intruder and authorizing the clients are eventual goals of these techniques. So, implement data hiding in DNA sequences will increase the confidentiality and complexity by using software point of view in cloud computing environments. By advent of biological aspects of DNA sequences to the computing areas, new data hiding methods have been proposed by researchers, based on DNA sequences. The key portion of this work is, utilizing biological characteristics of DNA sequences.

DNA Cryptography can be defined as a hiding data in terms of DNA Sequence. Information Security is very vital in today’s digital era of e-commerce and e-business. The data hiding in DNA sequences to increase the confidentiality and complexity by using software point of view in cloud computing environments. By utilizing some interesting features of DNA sequences, the implementation of a data hiding is to be applied in cloud. The key portion of their work is, utilizing biological characteristics of DNA sequences.

In order to convert binary data into amino acids as a DNA sequence, the base pairing rules must be used Synthesizing nucleotides in real environment (biology) is done in constant rules:

Adenine (A) always pairs with the Thymine (T)

Cytosine (C) always pairs with the Guanine (G)

In binary computing area, it is possible to change the natural rules by own decision.

For example, in biology A is synthesized to T while we can assume A to C or A to G, and so on, as we prefer. Increasing the complexity of the algorithm is the main purpose of the changing the rules. Let’s consider A=00, T=01, C=10, and G=11 to convert binary data to DNA sequences. A way to increase the complexity is complementary pair rule. Complementary pair rule is a unique equivalent pair which is assigned to every nucleotides base pair.

As an example, complementary rule is applied on strand in below:

Complementary rule: ((AC) (CG) (GT) (TA))

DNA strand: AATGC

Applying complementary rule on DNA strand: CCATG

Comments (11)

-1′ OR 2+723-723-1=0+0+0+1 or ‘HUC0Z3Ni’=’

-1); waitfor delay ‘0:0:15’ —

1 waitfor delay ‘0:0:15’ —

VTPJomfu’; waitfor delay ‘0:0:15’ —

8m0bGd4D’; waitfor delay ‘0:0:3’ —

-5 OR 543=(SELECT 543 FROM PG_SLEEP(15))–

-5) OR 866=(SELECT 866 FROM PG_SLEEP(15))–

-1)) OR 560=(SELECT 560 FROM PG_SLEEP(15))–

Uvu0V03Z’ OR 576=(SELECT 576 FROM PG_SLEEP(15))–

CsJZ96UT’) OR 902=(SELECT 902 FROM PG_SLEEP(15))–

fxiYgyua’)) OR 411=(SELECT 411 FROM PG_SLEEP(15))–

Leave a comment