You are on page 1of 15

# A NEW APPROACH FOR DATA ENCRYPTION USING GENETIC ALGORITHMS

Under the guidance of: Mr. Radhakrishna Dodmane Assistant Professor Department of CSE N.M.A.M. Institute of Technology, Nitte

1. INTRODUCTION 2. OVERVIEW OF CRYPTOGRAPHY 3. LITERATURE SURVEY 4. DESIGN 5. IMPLEMENTATION 6. EXPERIMENTAL RESULTS 7. CONCLUSION AND FUTURE WORK REFRENCES

In todays information age, information sharing and transfer has increased exponentially. Security is the most important factor in information system. The purpose of the project is to communication unintelligible to everyone except the intended receiver(s). Protect sensitive information in a large number of applications including personal data security, internet security, diplomatic and military communications security, etc. through the processes of encryption/decryption.

There are two types of cryptographic schemes: symmetric cryptography and asymmetric cryptography.

## Goal of Cryptography Confidentiality , Data integrity, Authentication , Nonrepudiation

A. Tragha et al.[9, 10], in 2005 & 2006 describe a new symmetrical block ciphering system named ICIGA (Improved Cryptography Inspired by Genetic Algorithms) which generates a session key in a random process. M. Husainy [11] in 2006 proposes Image Encryption using Genetic Algorithm based Image Encryption using mutation and crossover concept.

LFSRs (linear feedback shift registers) provide a simple means for generating non sequential lists of numbers quickly on microcontrollers. Generating the pseudo-random numbers only requires a left-shift operation and an XOR operation.

Choose a random point on the two parents Split parents at this crossover point Create children by exchanging tails 1-point Parent 1: 1 0 1 0 | 0 0 1 1 crossover Parent 2: 0 0 1 1 | 0 1 0 0

Offspring 1: Offspring 2:

1010|0100 0011|0011

THE ENCRYPTION PROCESS We consider two consecutive bytes of the data stream A1 and A2 as A1 = 11100010 A2 = 11001001 Consider decimal value sequence of LFSR as Zn=276, 78, 98, 26.. After taking mod 8 of Z1 it becomes Z1=4 After crossover A1 and A2 with Z1=4 B1 = 11101001 B2 = 11000010 After XOR B1 with Z2 (78) and B2 with Z3 (98) we get cipher text as C1=B1Z2 = 1110100101001110 =10100111 C2=B2Z3 =11000010 01100010 =10100000

## Time analysis of the encryption:

Conclusion: In this Project, we have proposed a new approach for esecurity. We used the concept of genetic algorithms in cryptography along with the randomness properties of LFSR. This way of transferring secret information is highly safe and reliable. So, without the knowledge of the pseudorandom sequence no one will be able to extract the message. Future Work: In the future work, we plan to design a sophisticated software based on this technique which will be targeted to use in highly secure multimedia data transmission applications.

[1] J.Daemen and V.Rijmen. The Design of Rijndael, AES-Advanced Encryption Standard}, ISBN 3-540-42580-2 (Springer-Verlag Berlin Heidelberg, New York). [2] Data Encryption Standard (DES),National Bureau Standards FIPS Publication 46(1977). [3] R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Commun. Assoc. Comput.(1978) [4] Menzes A. J., Paul, C., Van Dorschot, V., Vanstone, S.A., Handbook of Applied Cryptography, CRS Press fifth Printing 2001. [5] Douglas, R. Stinson, Cryptography- Theory and Practice, CRC Press, 1995. [6] Wenbo Mao, Modern Cryptography: Theory and Practice, Publisher: Prentice Hall PTR, Copyright: Hewlett Packard, 2004. [7] A Kumar, N Rajpal, Application of Genetic Algorithm in the Field of Steganography, in Journal of Information Technology, Vol. 2, No.1, JulDec.2004, pp-12-15.