Research and Reviews - International Journals

International Journal of Innovative Research in Computer and Communication Engineering

Menu

ISSN ONLINE(2320-9801) PRINT (2320-9798)

All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.

Application of Genetic Algorithm in Communication Network Security

SomalinaChowdhury1, Sisir Kumar Das2, Annapurna Das3
  1. Assistant Professor, Dept. of C.A,Guru Nanak Institute of Technology, Kolkata, India.
  2. Professor and Dean – Research & Administration, Guru Nanak Institute of Technology, Kolkata, India.
  3. Professor &Principal, Guru Nanak Institute of Technology, Kolkata, India.
Related article at Pubmed, Scholar Google

Visit for more related articles at International Journal of Innovative Research in Computer and Communication Engineering

International Journal of Innovative Research in Computer and Communication Engineering

Abstract

In this paper an Encryption and Decryption algorithm have been designed for communication network using Genetic Algorithm (GA) to make the total cryptography process much faster, robust, and highly secure. Here block cipher and one point crossover is used for simplification. GA is used as a part of Encryption and Decryption technique. It is a complex and highly secured concept to break by intruders, but easy to implement in the design.

Keywords
Encryption, Decryption, Selection, Crossover, Mutation, key, Fitness Value, XOR, Permutation, block cipher.

INTRODUCTION
Online transaction is nowadays most common practice in our daily life. So network security has become one of the most concern era. Cryptography is one of the techniques to communicate through insecure network securely. At the same time Genetic Algorithm (GA) is one of the newly emerging problem solving techniques which is gaining popularity due to its robustness. GA offers significant benefits over other optimization techniques in searching a large state space.
Cryptography is the art of processing information secretly. The basic element of cryptography is Algorithm for encryption and decryption of information and the other one is the key used.
Geneticalgorithms belong to the larger class of evolutionary algorithms (EA), which generate solutions to optimization problems using techniques inspired by natural evolution, such as mutation, selection, and crossover. Here we have used two point cross over. And the fitness function is used for taking decision of further movement.

RELATED WORK
In literature to date, there are many popular encryption technique are present namely DES, RSA etc.[1] And many GA based encryption algorithms have also been proposed. A. Tragha et.al [2] have describe a new symmetric block cipher system namely, ICIGA (Improved Cryptographic Inspired by Genetic Algorithm) which generates a session key in a random process. The block size and key length are variables and can be fixed by the end user in the beginning of the cipher process. ICIGA is an enhancement of the system GIC (Genetic Algorithm inspired Cryptography) [3]. There are various proposed methods for image encryption such as quad tree approach, cellular automata [4, 5]. There are wide applications of GA in solving non-linear optimization problems in various domains [6]. But very few papers exist which exploit the randomness in the algorithm for implementation of security. Chaos theory and entropy have large application in secure data communication and the desired disorder is provided by inherent nature of genetic algorithm [7, 9]. Mohammad SazzadulHoque et.al [10] have presented an intrusion detection system by applying GA to efficiently detect various types of network intrusions. They have used evolutionary theory to filter the traffic data and thus reduce the complexity [11]. There are several papers related to IDS all of which use GA in deriving classification rules [12, 14].
In this paper we have made an attempt, to build an encryption algorithm inside which we have introduced genetic algorithm. It’s Strength lie in its key size i.e., 64 bit.

PROPOSED ALGORITHM
A. Proposed Encryption Algorithm
Step: 1
Divide the plain text in 64 bits block each and encrypt each block.
Step: 2
Arrange these 64 bits into 4 x 16 table format. For example:
image
Step: 3
Four bit shifting per row in a cyclic fashion as highlighted
image
Step: 4
Now divide into two block (32 bits per block). Left part(LP) and Right part(RP).
image image
Step: 5
Perform Expansion permutation with RP.As shown:
Here some bits from the input are duplicated at the output; e.g. the fifth bit of the input is duplicated in both the sixth and eighth bit of the output. Thus, the 32-bit half-block is expanded to 48 bits.
Step: 6
Now generate key of 48 bit (Explained later).
Step: 7
Apply XOR with 48 bit key and 48 bit RP to get new RP of 48 bit.
Step: 8
Now with the result apply genetic algorithm operations like selection, crossover and mutation.
Fitness Function:
From new 48 bit RP make 4 x 12 table. Let the table be:
image
Fitness will be calculated for each row of the above table. The fitness function will count the number of ones in each row. If the number of one’s is 6 then fitness is 6 for that row. Similarly calculate for other rows. Then finally count the total fitness. Now perform selection.
Selection:
Consider 1st and 3rd row as 1st pair of parent and other as 2nd pair of parent.
Let the new RP of 48 bit in 4 x 12 table as:
Before selection:-
image
After selection:-
imageimage
Crossover (Two point crossover):
We will randomly choose any two numbers from 1 to 12 as cross over point and implement crossover. Here the points are (3,9).
imageimage
Similarly the other two parent pair will also create another two child.
Mutation:
We will randomly choose any one numbers from 1 to 12 as mutation point and implement. Here the point is 6(let). Shown the result after mutation.
image
Now combine C11, C12, C21 and C22 to get RP.
Now again calculate Fitness same way. If the new fitness is lower then go to next step else again perform mutation, selection, and crossover.
Step: 9
Perform XOR operationwith LP of step 4 and the result of step 8 which is new RP. XOR gate work as:-
Step: 10
And the RP of step is taken as LP.
Step: 11
Now recombine LP of step10 and RP of step 9 to transform in 16 x 4 table.
Step: 12
Four bit shifting per column in a cyclic fashion as given below.
imageimage
Step: 13
The resultant is the original cipher text.
B. Proposed Key Generation Technique:
Step: 1
At first random 64 bit are taken. And arrange them into table of 8 x 8format.
image
Note:
For 1st block of 64bit plain text the key creation will discard 8th column for next 64 bit it will discard 7th column so as on. And from 9th block again start from 8th column and continue.
Step: 2
Now truncate the 8th column of the table,the result will be of 56 bit key.
image
image
Step: 3
Arrange 56 bit into table of 8 x 7 format. And truncate mid or 4th row.
image
Step: 4
Now the key of 48 bit is ready to use. Shown in 4 x 12 format.
image
C. Implementation in JAVA
We can implement the above algorithm in JAVA to get the result. The files uses for the algorithm are:
image
Here in this paper an encryption technique is introduced which will prove to be a strong encryption technique for the unauthorized party to break the code. Here the key needed to share very efficiently as strength lie in key mostly. In near future it can prove to be a popular genetic-encryption technique.
Here the randomness of genetic algorithm and secrecy of cryptography has made this algorithm strong one. And the key transformation process also improved its efficiency. Although many of its steps and key generation techniques are inspired from DES algorithm but flavour of GA makes it unique.

Figures at a glance
Figure 1 Figure 2 Figure 3 Figure 4
Figure 1 Figure 2 Figure 3 Figure 4
Figure 1 Figure 2 Figure 3
Figure 5 Figure 6 Figure 7
 

References