Cryptography and Bioinformatics techniques for
Secure Information transmission over Insecure
Channels
Siddaramappa .V1
Research Scholar, Department of CS&E
R.V College of Engineering, VTU,India
siddavmk@gmail.com
Abstract - Today the information communication over insecure
channels is most significant problems. In order to solve this
problem, cryptography and bioinformatics algorithms both solves.
Cryptography is art of method of to creation of cipher text from
information or data and Bioinformatics is uniquely identifies
human beings based on DNA and RNA characteristics. In this
paper we have proposed a technique of encryption and decryption
based on Cryptography and Bioinformatics. In this proposed
algorithm, a new method of deoxyribonucleic acid and RNA as keys
generated for secure data encryption and decryption methods over a
communication to hide message from intruder or third party.
Moreover a new method of random creation of deoxyribonucleic
acid sequence and converting those into binary representation. The
proposed system provides high level of security for data or
information compare to existing algorithms.
Keywords: Information communication; Cryptography and
Bioinformatics; Deoxyribonucleic acid and RNA; Intruder;
Secure cipher
I. INTRODUCTION
Today data communicates over networks is an rapid
growth of emerging methods use of applied science and
technology. Due to insecure of information over
communicating we need to improve existing methods and
learning features for communicates in the presence of
introducer hacking technologies in the world to protect
data[1].
The term communication, which includes telephony,
telegraphy and television means communication at a distance.
The term data means entropy available in distinct that is
understood on both sides like sender or receiver. Transmission
of information between any entities may be wired or wireless.
Each entity consists of software and hardware to involve in a
communication . The performance of a system depends on
essential features of entropy delivery, accuracy, timeliness,
security, performance etc.
978-1-4673-9223-5/15/$31.00 2015
c IEEE
Ramesh K . B 2
Department of IT,
R.V College of Engineering ,VTU,India
ramesh_k_b@hotmail.com
An entity is an able to both sending and receiving
information. Two entities can send bit streams or byte stream
to each other and able to understand. To have complete
communication, the entities must agree on a group of rules.
The layered approach is mostly used for communicates and
networks area earlier than open systems interconnection
approach. Everybody believed that the open system approach
is secure standards for data communications, not sure about
this. The TCP/IP model suite became the major model hence
it is using in the Internet applications [2].The open system
model was incomplete implementation for communication.
The OSI model is a layered outline of network systems
that allows interact between all types of computer systems.
Session Layer and presentation Layer are important in data
communication to protect data from adversaries because
Encryption and Decryption are very important process in this
layer.
Organization
The rest of this paper is organized as follows. We
introduce existing system problems in section II. An secure
algorithm proposed in section III. We analyze security of
information proposed in section IV. Finally ,the conclusions
are given in section V.
II. EXISTING SYSTEM AND PROBLEMS
.
Cryptography is art of writing how to secure information
from unauthorized person. Basic knowledge of information
processing during communication between two entities. More
generally, it is regard to a group of rules for construction and
analyzing correct behavior in the presence of adversary.
These are threatening to different form of information
security like data confidentiality, integrity and authentication.
Present and recent cryptography consists of applied
mathematics computer and science. The use of cryptography
137
includes Teller Machine , user name and passwords for e- In 1953 two scientists James D. Watson and Francis crick
commerce and system. identified a complete structure and function of DNA also got
Nobel Prize[4].
The Cryptosystem consists of keys, algorithms of
encryption and decryption are part of cryptosystems to each
key. Keys are play major role, as a convert plain text to
ciphers with specific order knowledge of the generation of
cipher therefore to protect message from third party.

Network security issues are removed using cryptography

which is based on a science and mathematical characteristics.
We are main idea is to give methods based on dna properties
for cryptography to protect network issues. There are two
cryptography algorithms based on keys: symmetric key and
asymmetric key cryptography algorithms.

In symmetric key cryptography method the same key is
used to sending and receiving entities. The sender and
receiver are being used for an encrypt/decrypt information
with same key.
In asymmetric key , two keys are private and public. The
private key is retained in sender side and public key is
announced to the public. In public key encryption/decryption,
the private used for encrypt while public for decrypt methods
In symmetric key cryptography ciphers are generated by
substitution and transposition methods, but these ciphers can
be obtained by recursive methods applied by introducer.
These algorithms faces problems of man in the middle
attack and protection of keys generated at the sender and
receiver sides. Authentication is one of the major
characteristics in networks to protect data from the
adversaries.
III. PROPOSED SYSTEM
DNA computing is a recent method of imitate bio-
molecular structure of DNA and computing by means of
molecular biology technological computation [3]. The rapid
parallelism, more power and huge data volume available in
dna bases. These are secure to storing and processing data.
DNA based cryptography is an emerging of area in
cryptography due to the research of DNA computing [6].
Fig.1 Sender and Receiver architecture
The NCBI contains a huge amount dna data derived from
labs experiments and order in a sequences manner we can
access and analysis on different resources [5].
Algorithms
Encryption Algorithm
Step 1 : convert input data into binary
Step 2: binary data into A,T,G AND C letters
Step 3 : Key value from server
Step 4 : apply complementary rules step 2 and 3
Step 5: Apply XOR operation between output from step 4
Step 6 : Convert output from step 5 into DNA sequence
Step 7: Convert DNA sequence into ASCII Values
Step 8: Convert into Binary format (cipher data)
Decryption Algorithm
Step 1: Convert cipher data (binary format) into ASCII
value of DNA sequence
Step2: Convert DNA sequence (output) from step 1 into
Binary sequence
Step 3: Convert binary into DNA sequence
Step 4: Key value from server
Step 5: apply complementary rule for step 3 and 4

In this paper, an decryption or encryption methods are
implemented based on DNA properties like replication,
mRNA, translation and transcription. A new generation key
scheme based on DNA is proposed. By using nucleotides and
RNA present in a human being living cell. DNA consists of 2
types of purine and pyrimidine bases A, T, C and G.
Step6: XOR operation between step3 and step4 after
step5
Step 7: original binary format after step 6
In the binary format, 0 complement is 1and 1
complement is 0 . hence 00 and 11 are complement to
each. 01 and 10 are also complement. Here A is 00 T is 11

138 2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)
 G is 01 C is 10 and ASCII value of G is71 C is 67 A is 65 IV. SECURITY ANALYSIS
T is 84.

In this paper we consider two important properties of data

Encryption Algorithm example security are key length and sensitivity analysis. For N bit key
of DNA sequence, the key length is 2N for single bit of
Binary data: 10111010 A=00 T =11 Nucleotide bits. The larger the N is, larger is the key space and
G=01 C=10 DNA contains 3 billion keys. The Brute force techniques
impossible to find keys. The proposed algorithm also shows
Step2: 10 11 10 10 sensitivity to slight change in key values like bits position then
C T C C all bits are changes in step 3 and 4 steps proposed algorithm.
Step 3: T T G A (key value)
Step 4: GAGG V. CONCLUSION
AACT
Step 5: 01000101 The proposed algorithm is better than AES and DES . The
proposed algorithms uses large key values and uniqueness of
00001011 DNA characteristics .Each DNA consists of 3 Billion keys for
01001110 small information of binary data. It will be able to provides
stronger protection against the various intruder's attacks like
Step 6: G A T C cipher text only, chosen cipher text etc.
Step 7 :
Nucleotide ASCII values Binary format REFERENCES
A 65 1000001
[1] Coron,J.S., ”What is cryptography ?”,IEEE Security and Privacy Journal
T 84 1010100 ,12(8),2006,p.70-73.
G 71 1000111 [2] Fagen Li and Pan Xiong “ Practical Secure Communication for
Integrating Wireless Sensor Networks Into the Internet of Things” in
C 67 1000011 Sensor Journal ,IEEE Vol. 13,no.10,pp.3677-3684,2013.
[3] C.C. Chang, T. C. Lu, Y.F. Chang , R.C.T. Lee, “Reversible data hiding
schemes for deoxyribonucleic acid (DNA) medium” ,International
71 65 84 67 Journal of Innovative Computing Information Control 3(2007).
Step 8: Convert into Binary from output step 7 [4] Watson, J.D., Crick, F.H.C., “A Structure for De-oxy Ribose Nucleic
Acid “,Nature,vol.25(1953),pp.737-738.
1000111 1000001 1010100 1000011 This is cipher text [5] National Centre for Biotechnology
of binary 10111010 Information,http://www.ncbi.nlm..nih.gov/
[6] Weng – Long Chang “Fast Parallel DNA-Based Algorithms for
Decryption: Apply decryption steps to get original data Molecular Computation: Quadratic Congruence and Factoring Integers “
IEEE Transactions on NanoBiosciences, Vol.11,no.March 2012.

2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) 139