Genetic Key Generation for Public Key Cryptography
Sonia Goyat, Student,M. Tech, Department of computer science and applications ,MDU,Rohtak.
Manuscript received on July 01, 2012. | Revised Manuscript received on July 04, 2012. | Manuscript published on July 05, 2012. | PP: 231-233 | Volume-2, Issue-3, July 2012. | Retrieval Number: C0814062312 /2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The importance of cryptography can be judged by the fact that it is used almost everywhere. It is essential in e transactions, LAN data transfer, in Databases and even while storing data in our own computer. There are many methods of cryptography. Some of that have large complexity and are pretty cumbersome, while other are based on the theory of natural selection. The fact that selecting key for the public key cryptography is a selection process in which various keys can be categorized on the basis of their fitness, makes Genetic Algorithms a good contender for the process to be followed for generating key. Moreover, using Genetic Algorithm we can keep the strength of the key as good as any other key, still make the whole algorithm good enough to have a complexity as low as O(n2 ). The work is based on one such approach  and modifies the approach to generate keys that have more strength as compared to previous work .The work has been implemented and analyzed. The results obtained are good in terms of coefficient of autocorrelation. The samples satisfy the tests including gap test, frequency test etc
Keywords: Public Key Cryptography, One Time Pad, Genetic Algorithms, Vernam Cipher.