A Cryptographic Scheme Based on Chaos Synchronization and Genetic Engineering Algorithm
The chapter introduces a robust method of digital cryptography based on Genetic Algorithm (GA) and synchronization of two identical systems driven by Gaussian white noise. GA explores the search space using the probabilistic operators that emulates the biological evolution process to solve complex combinatorial problems. But their randomness property self-imposes a problem in specific goal oriented applications where satisfactory solution is the yardstick of successful application. For the purpose of successful encoding and recovery of a message, we have proposed a genetic engineering scheme based on GA. The basic selection mechanism of GA is modified to control such random behavior with the help of a special learning mechanism. Otherwise, it may lead to a solution which is uncorrelated with the original message and may also lead to the loss of information.The parameters and the keys are secure because the synchronized dynamical system does not necessitate the transmission of keys over the communication channel.This property further makes the proposed method computationally cheap and resistant to the traditional man in the middle attack. The above stated aim is illustrated with simple examples using the two most popular recombination scheme-one point and two-point crossover. The precise recovery of the ciphertext, without complex modeling of the system, proves that the proposed genetic engineering algorithm for cryptography is effective,reliable and computationally cheaper than cryptography designed with (μ ∕ ρ, λ) -ES selection mechanism.
KeywordsGenetic Algorithm Chaotic System Cipher Text Evolution Strategy Hybrid Version
The author is thankful to S.Mukhopadhyay, University of Calgary, for some useful discussions.
- 1.Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 3.Srinivas, M., Patnaik, L.M.: IEEE Comput. 17–26 (1994)Google Scholar
- 6.Beyer, H.-G.: Natural Computing Series. Springer, Berlin (2001)Google Scholar
- 8.Hansen, N., Müller, S.D., Koumoutsakos, P.: Evol. Comput. 11, 1 (2003)Google Scholar
- 10.Schwefel, H.P.: Evolution and Optimum Seeking. Wiley, New York (1995)Google Scholar
- 11.Mukhopadhyay, S., Mitra, M., Banerjee, S.: Chaos Synchronization and Cryptography for Secure Communications: Applications for Encryption, IGI Global, USA, pp. 476–509 (2010)Google Scholar
- 20.Klein, E., Mislovaty, R., Kanter, I., Kinzel, W.: Public-channel cryptography using chaos synchronization. Phys. Rev. E 016214(1–4) (2005)Google Scholar
- 26.Banerjee, S., Ghosh, D., Ray, A., Roy Chowdhury, A.: Europhys. Lett. 81, 20006 (2008)Google Scholar
- 27.Ghosh, D., Banerjee, S., Roy Chowdhury, A.: Europhys. Lett. 80, 30006 (2007)Google Scholar