z-logo
open-access-imgOpen Access
Anefficient 2-Step DNA symmetric cryptography algorithm based on dynamic data structures
Author(s) -
Jossy P. George,
Joseph Varghese Kureethara
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.6.10140
Subject(s) - computer science , plaintext , encryption , dna computing , theoretical computer science , cryptography , petabyte , key (lock) , computation , symmetric key algorithm , key space , algorithm , distributed computing , public key cryptography , computer network , big data , computer security , data mining
The security of text has become highly demanding in today’s fast growing networking world. DNA computing is one of the emerging technologies in the arena of huge data storage and parallel computation. A single gram of DNA holds 5.5 petabytes of data. This leads to the increased risk in data communication. DNA in computers is mapped to human genome. Thus, the sequence of nucleotide base constructs the foundation of uniqueness. In this paper, a new scheme acronymed as –‘Cryptography on DNA Storage’-CDS is provided. It performs the DNA data encryption in just two-step by using random private key for each letter in the plaintext and parallel swapping of the resultant text in small clusters. It is discussed keeping the time and space complexity of the algorithm in concern.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here