Computer Network | DNA Cryptography



Cryptography is the branch of science which deals with the encoding of information for the purpose of hiding messages. It plays a vital role in the infrastructure of communication security. The Pioneering work had been done by Ashish Gehani et al and Amin et al after Leonard Max Adleman had shown the capability of molecular computation in 1994. This paved the way for DNA Computing. DNA Cryptology combines cryptology and modern biotechnology.

Why DNA Cryptography?

  • DNA Cryptography is one of the rapidly evolving technologies in the world.
  • Adelman showed the world how it can be used to solve complex problems like directed Hamilton path problem and NP-complete problem (for example Travelling Salesman problem). Hence user can design and implement more complex Crypto algorithms.
  • It brings forward new hope to break unbreakable algorithms. This is because DNA computing offers more speed, minimal storage and power requirements.
  • DNA stores memory at a density of about 1 bit/nm3 where conventional storage media requires 1012 nm3/bit.
  • No power is required for DNA computing while the computation is taking place.
  • Surprisingly, one gram of DNA contains 1021 DNA bases which is equivalent to 108 TB of data. Hence can store all the data in the world in a few milligrams.

DNA Cryptography can be defined as a hiding data in terms of DNA Sequence. Just like the RSA and DES algorithms, in DNA Cryptology user have DNA algorithms like “Public-key system using DNA as a one-way function for key distribution,” “DNASC cryptography system”, DNA Steganography Systems, Triple stage DNA Cryptography, Encryption algorithm inspired by DNA and Chaotic computing.

So, how do encode data in a DNA strand which is mainly made, up of 4 nitrogenous bases namely:

  1. Adenine (A)
  2. Thymine (T)
  3. Cytosine (C)
  4. Guanine (G)

The easiest way to encode is to represent these four units as four figures:



A(0) –00
T(1) –01
C(2)–10
G(3)–11 
  • By these encoding rules, there are 4!=24 possible encoding methods. Based on some principles as A and G make pairs while T and C make pairs.
  • Of those 24 methods, only 8 match the DNA pairing rule but the best encoding scheme is 0123/CTAG.

So now converted our initial number into a sequence of A, T, G and C theoretically. This is then physically implemented using various DNA synthesizing techniques like Chemical Oligonucleotide Synthesis and Oligo Synthesis Platforms (this includes Column-Based Oligo Synthesis, Array-based Oligo Synthesis, Complex Strand and Gene Synthesis and Error Correction).

Let’s take an example of the classic XOR One Time Pad and see how its implemented using DNA Cryptography:

Example – Let M be the message and K be the key. The Ciphertext is obtained by finding M xor K = C. User can again obtain the Encoded message by doing: C xor K = M xor K xor K= M. Hence, get our original message. The steps involved in implementing it is:

  1. The message and the OTP key are converted to ASCII bits
  2. Zero Padding is added to the message and the key in order to make the size of their binary codes even
  3. The message and the key are XORed together
  4. The XOR output is represented in DNA bases format.This is our enciphered text.

The decryption process involves the following processes and hence it is also prone to eavesdropping:

  1. All the DNA bases are transformed into bits.
  2. These bits are then XORed with the OTP key bits to reproduce the original plain text.
  3. This text so obtained in binary format is then converted into a sequence of ASCII characters.

Similarly, user can implement other crypto algorithms like AES and even DES. Instead of storing data as a sequence of 0s and 1s, storing them as a sequence of nitrogenous bases. Storing information in the form a DNA enables us to store a lot of data in a small area.



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.