Professional Documents
Culture Documents
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
ABSTRACT
Proposing an algorithm by using software point
of view for the purpose of implementing data
hiding based on DNA sequences to increase the
complexity is the main target of this paper. The
implementation of algorithm is applicable
because of some interesting characteristics of
DNA sequences. Both of DNAs features and
Binary
Coding
Technology
beside
Complementary Pairing Rules are explained
through the paper. Since, both of a secret
message (M) and DNA reference sequence is
needed. Data hiding is started by applying three
different and separate steps to prepare M. The
receiver will apply the process of identifying and
extracting the original message (M) which had
been hidden in DNA reference sequence. As the
security of the algorithm is crucial part, it will
appear in security issues section.
KEYWORDS
DNA sequence; data hiding; DNA
base pairing rules; complementary
pairing rules; DNA binary coding.
INTRODUCTION
183
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
Purine Adenine
(A)
always
pairs
with
the pyrimidine Thymine (T)
Figure 1.
naturally
Synthesizing
basic
nucleotides
RELATED WORKS
184
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
European
Bioinformatics
Institute
(which is known as EBI Database) [15]
for the purpose of extracting DNA
sequences of Litmus and Balsaminaceae.
So, Litmus with 154 nucleotides and
Balsaminaceae with 2283 are shown in
below, respectively:
Litmus:
ATCGAATTCGCGCTGAGTCACAA
TTCGCGCTGAGTCACAATTCGCGC
TGAGTCACAATTGTGACTCAGCCG
CGAATTCCTGCAGCCCCGAATTCC
GCATTGCAGAGATAATTGTATTTA
AGTGCCTGCTCGATACAATAAACG
CCATTTGACC.
Balsaminaceae:
TTTTTATTATTTTTTTTCATTTTTT
TCTCAGTTTTTAGCACATATCATT
ACATTTTATTTTTTCATTACTTCTA
TCATTCTATCTATAAAATCGATTA
TTTTTATCACTTATTTTTCTAATTT
CCATATTTCATCTAATGATTATATT
ACATTAAAGAAATCG.
Even though data can be shown by DNA
nucleotides, but representing to binary
was emerged in 1999 by Rauhe and et al.
[17]. They represented numbers by using
binary DNA sequences in figure 1. The
creativity of their work was in how they
could separate binary sequences from
each other.
S=
ATGCTTAGTTCCATCGGAGACTAATGGCCTA
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
PROPOSED METHOD
3.1 Phase1:
Message
Embedding
Secret
M= Message
Convert Binary to DNA Nucleotides
M=DNA Sequence
from M
Applying Complementary Rules on M
M= New Form of M
Finding Index of each Couple of Nucleotides in
DNA Reference Sequence
M=Secret Message
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
Extracting
Original
M= Previous Form of M
Applying Complementary Rules on M
M=DNA Sequence
from M
Convert Binary to DNA Nucleotides
M= Message
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
SECURITY ISSUES
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
Binary
coding
rule:
as
mentioned, the sender is free to
select any equivalent binary form
for every nucleotide. It means
that, A can be 00, 01, 10, or
11; C can be 00, and so on.
In other words, all the binary
coding rules are 4321=24.
So, the likelihood of making
.
correct guess by attacker is
CONCLUSION
190
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
REFERENCES
191
International Journal on New Computer Architectures and Their Applications (IJNCAA) 2(1): 183-192
The Society of Digital Information and Wireless Communications, 2012 (ISSN: 2220-9085)
Table 1. The mapping of codon to amino acid [18].
UUU Phe
UUA Leu
CUU Leu
CUA Leu
AUU Ile
AUA Ile
GUU Val
GUA Val
UUC Phe
UUG Leu
CUC Leu
CUG Leu
AUG Ile
AUG Start
GUC Val
GUG Val
UCU Ser
UCA Ser
CCU Pro
CCA Pro
ACU Thr
ACA Thr
GCU Ala
GCA Ala
UCC Ser
UCG Ser
CCC Pro
CCG Pro
ACC Thr
ACG Thr
GCC Ala
GCG Ala
UAU Tyr
UAA Stop
CAU His
CAA Gln
AAU Asn
AAA Lys
GAU Asp
GAA Glu
UAC Tyr
UAG Stop
CAC His
CAG Gln
AAC Asn
AAG Lys
GAC Asp
GAG Glu
UGU Cys
UGA Stop
CGU Arg
CGA Arg
AGU Ser
AGA Arg
GGU Gly
GGA Gly
UGC Cys
UGG Trp
CGC Arg
CGG Arg
AGC Ser
AGG Arg
GGC Gly
GGG Gly
192