IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Chaos Synchronization with Genetic Engineering Algorithm for Secure Communications

Chaos Synchronization with Genetic Engineering  Algorithm for Secure Communications
View Sample PDF
Author(s): Sumona Mukhopadhyay (Army Institute of Management, India), Mala Mitra (Camellia School of Engineering, India)and Santo Banerjee (Politecnico di Torino, Italy)
Copyright: 2011
Pages: 34
Source title: Chaos Synchronization and Cryptography for Secure Communications: Applications for Encryption
Source Author(s)/Editor(s): Santo Banerjee (Politecnico di Torino, Italy)
DOI: 10.4018/978-1-61520-737-4.ch021

Purchase

View Chaos Synchronization with Genetic Engineering Algorithm for Secure Communications on the publisher's website for pricing and purchasing information.

Abstract

Sumona Mukhopadhyay, Mala Mitra and Santo Banerjee have proposed a method of digital cryptography inspired from Genetic Algorithm(GA) and synchronization of chaotic delayed system. The chapter introduces a brief idea about the concept of Evolutionary Algorithm(EA) and demonstrates how the potential of dynamical system such as chaos and EA can be utilized in a reliable, efficient and computational cheaper method for secure communication. GA is a subclass of Evolutionary algorithm and as such is governed by the rules of organic evolution. In GA the selection mechanism and both transformation operators-crossover and mutation are probabilistic. In their proposed method for cryptography, the parameters and  keys of the system are secure since the synchronized dynamical system does not necessitate the transmission of keys over the communication channel. The random sequence obtained from chaotic generator further transforms it into a powerful stochastic method of searching the solution space in varied directions for an optimal solution escaping points of local optima. But randomicity can sometimes destabilize the system and there is no guarantee that it yields an improved solution. The authors have substituted the random and probabilistic selection operator of GA with problem specific operator to design the cryptosystem to control such random behavior otherwise it would lead to a solution which is uncorrelated with the original message and may also lead to loss of information. The way selection has been modified leads to two versions of the proposed genetic engineering algorithm for cryptography. Simulation results demonstrates that both the flavors of the proposed cryptography successfully recover the message. A comparison of their proposed method of cryptography with cryptography  developed from Comma-Based Recombination selection mechanism of Evolutionary Strategy shows a computational edge of their proposed work.

Related Content

Chaymaâ Boutahiri, Ayoub Nouaiti, Aziz Bouazi, Abdallah Marhraoui Hsaini. © 2024. 14 pages.
Imane Cheikh, Khaoula Oulidi Omali, Mohammed Nabil Kabbaj, Mohammed Benbrahim. © 2024. 30 pages.
Tahiri Omar, Herrou Brahim, Sekkat Souhail, Khadiri Hassan. © 2024. 19 pages.
Sekkat Souhail, Ibtissam El Hassani, Anass Cherrafi. © 2024. 14 pages.
Meryeme Bououchma, Brahim Herrou. © 2024. 14 pages.
Touria Jdid, Idriss Chana, Aziz Bouazi, Mohammed Nabil Kabbaj, Mohammed Benbrahim. © 2024. 16 pages.
Houda Bentarki, Abdelkader Makhoute, Tőkési Karoly. © 2024. 10 pages.
Body Bottom