2014 International Symposium on Biometrics and Security Technologies (ISBAST)

DNA Approach for Password Conversion Generator

Chng Chern Wei
Faculty of Computer Science and Information Technology
Universiti Putra Malaysia (UPM),
Serdang, Selangor, Malaysia
cwchng2u@yahoo.com.my

Abstract—The evolution of an information technology has II. BACKGROUND

been expended and growth rapidly since last decade, especially in
the era of an internet web technology, such as, e-commence, e- In this Chapter 2, provide the fundamental of the Finite
business or e-payment or e-shopping and more. The evolution of State Machine and the basic of the DNA theory.
an internet web technology has made the transmission of the data
or information over the web is more comprehensive. Thus, the
data or information is easy to hack, crack or spy by the A. Finite State Machine
unauthorized persons over the network. This paper proposed a
technique of cryptography to make the data or information to be A finite state machine is a mathematical model of
more secure during transmission over the internet technology computation, also named finite-state automaton. The objectives
based on the DNA Stenography with the Finite State Machine of the FSM are to design computer programs and the sequential
(Mealy Machine) theory. This proposed algorithm is able to logic of the programs [7]. Basically, the FSM have more that 1
securing the data or information at least 3 levels of combinations state in the presenting the sequential logic of the program but
for the password conversion. only have 1 start state or initial state in the program. Every
state is concatenated to each other and moving to the next
Keywords—e-commence; automata; DNA; security; related state at 1 time and this is called transition [7][8].
cryptographic
FMS divided into two types of machines, they are [ 8 ]:
I. INTRODUCTION
1) Synchronous FSM
Today, the expansions of the internet services over the
network in benefits us from the various areas such as The synchronous FSM is having the time input. These types
e-banking, e-commerce, secure Electronic Transactions (SET) of FSMs are known as Mealy Machine.
and others internet activities. Therefore, in securing the data
The concepts of Mealy Machine the Output of the Mealy
and information over the virtual communication, the techniques
of cryptographic are widely apply. Basically, the cryptographic Machine is strictly dependent on the Input of the machine and
technique is contain an algorithm, which is the sequential the Current States of presenting. In these conditions, the Mealy
procedural steps in performing the data encryption from the Machine accepted Null State, which is containing null.
plaintext into unreadable ciphertext and the data decryption
from the ciphertext converted into readable plaintext. Figure 1, shown the Mealy Machine with inputs, states the
transitions of the Mealy Machine in FSM.
This study proposed a new technique in providing the high
degree of security protection for the data and information by Input Output
using DNA cryptography, which contained of {A,T,G,C}.
Next Current Output
This algorithm performs in 3 major processes, that is
State Logic State Logic Logic
Encryption/Decryption process, DNA Code Conversion
process, Mealy Machine computation process. In this paper
also discuss about the fundamental of the Finite State Machine
and the brief of knowledge of the DNA theory in the Chapter 2.
Fig.1. Mealy Machine of FSM
Chapter 3, brief about the past related work to this study and
Chapter 4 is discuss about the methodology, the work
2) Asynchronous FSM
instructions and the simulated results by using JFLAP. Chapter
5, discuss about the simulation evaluation and Chapter 6 is
discuss about the benefits of the Finite State Machine in The asynchronous FSM are the type of the machine without
providing a comprehensive solution for this study and follow time input. These types of FSM are known as Moore machine,
by the conclusion in Chapter 7. as shown at Figure 2.

978-1-4799-6444-4/14/$31.00 ©2014 IEEE

161
 Input Output service is called “Web Service Composition” and it is identify
by using automata theory [13].
Next Current Output
State Logic State Logic Logic
B. Triple State DNA Cryptography [14]
Security of personal information, business transactions
Fig.1. Moore Machine of FSM information, financial data information and other important
related information are important in current era with E-
B. DNA Commence technology.
To make E-Commence transaction more secure and
Deoxyribo Nucleic Acid, commonly known as DNA in the
reliable, theory of cryptography is apply. Cryptography is the
short form. In molecular of the biology, the human genetic
technique of transfer or converts the plain (original) message
information is representing in DNA. The structure of the DNA
into the unrecognized form during the transmission of the
is made by the four types of the nucleotides, which [1][2][3]:
message. This is to prevent the original message to reach at
i. Thymine (T) unauthorized user or easily accessing by unauthorized person
ii. Cytosine ( C ) [14].
iii. Guanine ( G ) and IV. METHODOLOGY
iv. Adenine (A) This chapter defines the summary of theoretical framework
done in the research and the methods used.
A. Proposed Algorithm and Works Flow

The theoretical framework showed the steps of the

proposed algorithm. The proposed algorithm for this study is
shown at Figure 4.

Algorithm/Steps:
Begin:
Fig.3 The Backbone of DNA Strand [3][5] Step 1: The Internet users insert password to login
into the service.
Figure 3 is shown the structure of the DNA, where the
structure of the DNA at each of the single strand is linked Step 2: Password inserted will converted into
together with the hydrogen bond. encrypted password based on the DNA
Approach Password Conversion Generator,
This is to make the DNA structure becomes double strand
with the System Private Key (complement).
and it make the hydrogen bond between each other, which is C
and G is bond and A and T is link [1] [3]. Step 3: The new password with the key will transfer
to the service provider.
Step 4: The password will be verified by the service
III. LITERATURE REVIEW provider with System Private Key
(complement).
There have been several studies done before to develop an
algorithm by using the Automata Theory or DNA Approach. Step 5: Let the user’s access to the service, if the
These reviews of the related literature on the topics were done password is valid and reject the user’s, if the
in previous journals or article presented in the past conference. password is invalid.
There are comparisons made between the review on the End.
security, Cryptography, and the algorithm.
Below is the description of the review which is most
importantly related to this critical review title.
A. Automated Choreographer Synthesis for Web Service [13]

Web applications including internet E-Service, E-Business

and E-Commence are the most popular and powerful business
transactions application in current era. Addressing about the E-
Commence, it which required service oriented solutions to
implementing the functions. For this, web service can be more
complex and heterogeously developed the service can be
develop new desired service. The complexity of the web

162
 TABLE 1. MEALY MACHINE TRANSITIONS TABLE

Initial Next Output

State State
Sn A:Δ T:Δ G :Δ C:Δ Δ
S0 S1 S2 S3 S4 -
S1 S5 S6 S7 S8 -
S2 S9 S10 S11 S12 -
S3 S13 S14 S15 S16 -
S4 S17 S18 S19 S20 -
S5 S1 S2 S3 S4 E1
S6 S1 S2 S3 S4 E2
S7 S1 S2 S3 S4 E3
Fig.4. Study Work Flow S8 S1 S2 S3 S4 E4
S9 S1 S2 S3 S4 E5
S10 S1 S2 S3 S4 E6
S11 S1 S2 S3 S4 E7
B. Finite Machine Approach (Mealy Machine)
S12 S1 S2 S3 S4 E8
S13 S1 S2 S3 S4 E9
Mealy Machine of FSM is representing by the 6-tuples of S14 S1 S2 S3 S4 E10
the symbols. S15 S1 S2 S3 S4 E11
1) M = (Q, ∑, Δ, δ, λ, Sn), where: S16 S1 S2 S3 S4 E12
S17 S1 S2 S3 S4 E13
i. Q :
S18 S1 S2 S3 S4 E14
A Non-Empty Set of State in Mealy Machine.
S19 S1 S2 S3 S4 E15
ii. ∑ :
S20 S1 S2 S3 S4 E16
A Non-Empty Sets of Inputs.
iii. Δ :
A Non-Empty Sets of Outputs.
iv. δ :
A Transition Function of the Two Arguments of
the mealy machine.
v. λ :
A Mapping Function of the mealy machine.
Which:

Qx∑ Δ
vi. Sn :
It is an Initial State of mealy machine, Q.

2) Transition Table of the Mealy Machine in JFLAP

Simulation, as shown at Table 01.

In this step, the transition table shown on Table 1 is transfer

into the JPLAF simulator by using Mealy Machine and the Fig.5. Transitions Diagram as Simulated Using JFLAP
completed Mealy Machine is shown on the Figure 5.

163
3) Expected Result of the JFLAP Simulation Code Book and
Figure 06 shown JFLAP Simulation Results.

The completed Mealy Machine is able to simulated the

results, for the input of {A,T,G,C} is inserted. The expected
results of the combination of {A,T,G,C} for the Mealy
Machine is shown on the Table 2 and the simulated results in
the JPLAF is shown on the Figure 6.
TABLE 2. EXPECTED RESULT OF THE JFLAP SIMULATOR

No. 1st & 2nd 3rd Combination Encrypted

Combination of of Password
DNA Code DNA Code Character(s)
(ATGC) (ATGC)
1. AA TGC E1
2. AT CG E2
3. AG TC E3
4. AC TG E4
5. TA CG E5 Fig.7. JFLAP Simulation Results.
6. TT AGC E6
7. TG CA E7
8. TC AG E8
V. SIMULATION EVALUATION
9. GA TC E9
10. GT AC E10 The strangeness of proposed Password Conversion
11. GG ATC E11 Generator algorithm is test by using Brute Force Attack. The
proposed algorithm is able to generate of 16 bits of the cipher
12. GC AT E12
text of each password converted.
13. CA TG E13
14. CT GA E14 Based on the Brute Force Attack testing, 3 types of
15. CG TA E15 processor in difference speeds is choosing and the time taken
16. CC ATG E16 for break the proposed algorithm.

TABLE 3. BRUTE FORCE ATTACK IN BREAK OF PROPOSED ALGORITHM

Processors Type 2 Bits 4 Bits 6 Bits 8 Bits
Intel Dual – 0.417s 0.927s 1072.973s > 86400s
Core 2.6GHz
Intel i5 0.139s 0.603s 829.379s > 86400s
Intel i7 0.012s 0.121s 712.512s > 86400s

As the results, the verification process has shown positive

Fig.6. JFLAP Simulation Code Book Results
4) JFLAP Simulated Results, as shown on Figure 07.
In Figure 07 shown about the simulation results for the
combination {A,T,G,C} with the outputs according to the Code
Book results set as follow the Table 02, where the input is not
in the {A,T,G,C} will simulated as null.
on identifying all of the possible behaviors and able to shown
that the algorithm is able to provide a strong defend and not
easy to break/crack.
VI. DISCUSSION
The automata theory has been proven effective through
logics and mathematical. Among the factors contributing to
high level of designing a security cryptography algorithm in
applying to such e-commerce system, which highly suggested
to use an automata theory approach and techniques.
Automata approaches are allow making combinations
among the states and also can be test for the correctness of the
outcome designed.
More passed studies have been done by using an automata
approach and found that is a good approach applied for a wide
range in developing an cryptography systems and approaches
[1][2][3][6][13][14].

164
 VII. CONCLUSION & FUTURE RESEARCH
The evolution of the information technology expended in
this era especially in an internet services. The sensitive
personal data such as, personal login password, identification
numbers, credit card numbers, internet banking authentication
password and others. All of the sensitive personal data is
required more careful and alert during the transactions is made
over the network.
This study explorer an algorithm with using the Finite State
Machine (Mealy Machine) theory to simulate that, an
algorithm is secure and able to provide the high level
protection on the sensitive personal data during transmissions
via the internet connections.
Based on the fundamental of the algorithm designed, it able
to secure up to 3 levels of combination of the conversion and
the algorithm production of the conversion is not easy to break
by the unauthorized persons.
ACKNOWLEDGMENT
The authors wish to thanks Dr. Mohd Taufik Abdullah
from the Department of Computer Science, Faculty of
Computer Science and Information Technology, Universiti
Putra Malaysia (UPM) for his knowledge support on this study.
REFERENCES
[1] A.M.Ban, & K.A.Adeeba. “Proposed Steganography Approach Using
DNA Properties.” International Journal of Information Technology and
Business Management. Vol. 14, No.1, June 2013.
[2] P.Vijayakumar, V.Vijayalakshmi & G.Zayaraz. “Enhanced Level of
Security Using DNA Computing Technique with Hyperelliptic Curve
Cryptography.” ACEEE Int. J. On Network Security. Vol. 4, No.1, July
2013.
[3] G.Jacob & A.Murugan. “DNA Based Cryptography: An Overview and
Analysia.” International Journal of Emerging Science. Vol. 3, No.1,
March 2013.
[4] J.Patarin. “The “coefficients H” Technique.” University De Versailles.
2008.
[5] M. Reza, S.K.Nazanin & R.Azizallah. “Innovative Approach to Improve
Hybrid Cryptography by Using DNA Steganography.” International
Journal on New Computer Architectures and Applications. Vol. 2, No.1,
Pg.224-235, 2012.
[6] S.Harneet, C.Karan, D.Harsh & A.K.Verma. “DNA Based
Cryptography: An Approach to Secure Mobile Network.” International
Journal of Computer Applications. Vol. 1, No.19, 2010.
[7] P.A.Jyotirmie, A.C.Sekhar & S.U.Devi. “Application of Mealy Machine
and Recurrence Matrices in Cryptography.” International Journal of
Computer Science and Management Research. Vol. 2, Issue No. 6, June
2013.
[8] R.Kalihari, T.Verma & A.Jaiswal. “Concept of Automated Machine
Using Mealy.” International Journal of Computer Applications
Technology and Research. Vol. 2, Issue No. 3, Pg.335-339, 2013.
[9] M.Ana & S.Balwinder. “Finite State Machine Based Vending Machine
Controller with Auto-Billing Features.” International Journal of VLSI
Design & Communication System (VLSICS). Vol. 3, No.2, 2012.
[10] R.Susan. “Automata Theory and Application (JFLAP Ver. 7.0).” Duke
University, 2010.
[11] XILINX. “Lab Workbook – Finite State Machines (Ver. Nexys3) .”
Xilinx University, 2013.
[12] J.K.Hu & X.Kai. “Handbook of Information and Communication
Security (Bio-Cryptography).” Springer, 2010.
[13] R.Kumar & S.Basu. “Automated Choreographer Synthesis For Web
Services Composition Using I/O Automata.” IEEE International
Conference, July 2007.
[14] S.Rupali, P.Gopal, K.Arif & K.Deepak. “Triple Stage DNA
Cryptography Using Sequential Machine.” International Journal of
Advanced Research in Computer Science and Software Engineering.
Vol. 3, Issue 8, August 2013.
165