Key Exchange Based on Genetic Algorithm
Keywords:
key exchange algorithm, Genetic Algorithm, Mutation, Crossover, public key, Asymmetric Key Encryption.Abstract
in this study, has shown how to design key exchange algorithm based on the features of crossover and mutation operations of genetic algorithm (GA) and asymmetric key encryption. The number of the crossover points together with number of mutation points dictate the length of the secret key and hence the strength of the algorithm. The algorithm is further strengthened by making it difficult to break by permuting the key by a random permutation factor; the randomness together with permutation makes the algorithm robust and hard to break. The proposed algorithm solves the problem of storing and distribution of the secret key over the network; the various examples and implementation of the algorithm proves that it exchanges the keys over the channel successfully.
References
Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996.
Applied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C by Bruce Schneier Wiley Computer Publishing, John Wiley & Sons, Inc.
Poonam Garg, “Genetic Algorithm, Tabu Search & Simulated Annealing Attack on Transposition Cipherâ€, proceeding of third AIMS International conference on management at IIMA – 2006, 983-989
Holland, J., “Adaptation in Natural and Artificial Systemsâ€, University of Michigan Press, Ann Arbor, 1975.
Alhussain Amanie Hasn “Cryptosystem for Providing Secured Application based on Genetic Algorithm†International Journal of Emerging Technology and Advanced Engineering Certified Journal, Volume 4, Special Issue 5, June 2014, 8-14; International Research Conference on Engineering, Science and Management 2014 (IRCESM 2014)
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET
This work is licensed under a Creative Commons Attribution 4.0 International License.