Figure 1 - uploaded by Sumona Mukhopadhyay
Content may be subject to copyright.
Contexts in source publication
Context 1
... crossover or mixing of pairs of chromosomes occurs replacing the worst chromosomes with the better ones, or without replacement of the best chromosome by a technique known as elitism. Figure 1 shows two of the most common crossover schemes. The first subpart a and the other subpart b shows a schematic diagram of one point and two point crossover respectively. ...
Context 2
... first subpart a and the other subpart b shows a schematic diagram of one point and two point crossover respectively. In Figure 1a, crossover occurs with the elements of parents selected after the crossover point and in Figure 1b, crossover occurs with the elements lying in between Crossover point1 and Crossover point2. ...
Context 3
... first subpart a and the other subpart b shows a schematic diagram of one point and two point crossover respectively. In Figure 1a, crossover occurs with the elements of parents selected after the crossover point and in Figure 1b, crossover occurs with the elements lying in between Crossover point1 and Crossover point2. ...
Context 4
... generation 25 it has a high peak (y=40) which shows that the randomness takes more iterations to stabilize and come to a conclusion. Here we can see that the pseudo deterministic GEA takes more iterations to recover the plaintext, but it yields the best cipher text at the same generation 25 than the deterministic GEA. Figure 9 and Figure 10 for population size 40 shows a slightly different observation. The pseudo deterministic GEA attains a maxima at transmitter generation 30 but it also yields the best cipher text in the early generation at 15. Further, pseudo deterministic option takes more iterations to recover the plaintext for transmitter generation 40 and the cipher text obtained from it is of poor quality than the deterministic GEA. ...
Context 5
... the behavior is unpredictable which is sometimes advantageous in applications such as this. Figure 11 through Figure 14 shows a comparison between the proposed cryptography and cryptography with (μ / ρ, λ) selection. We can see that the Deterministic solution has overall low peaks after transmitter generation 15 and 1 in Figure 11 and Figure 13 respectively. ...
Context 6
... is interesting to note how both the schemes escape form getting stuck with a cipher text in a generation and gradually self adapt themselves to yield a better solution. Overall, the behavior is unpredictable which is sometimes advantageous in applications such as this. Figure 11 through Figure 14 shows a comparison between the proposed cryptography and cryptography with (μ / ρ, λ) selection. We can see that the Deterministic solution has overall low peaks after transmitter generation 15 and 1 in Figure 11 and Figure 13 respectively. ...
Context 7
... the behavior is unpredictable which is sometimes advantageous in applications such as this. Figure 11 through Figure 14 shows a comparison between the proposed cryptography and cryptography with (μ / ρ, λ) selection. We can see that the Deterministic solution has overall low peaks after transmitter generation 15 and 1 in Figure 11 and Figure 13 respectively. Whereas there are abrupt maxima and minima for cryptography with Pseudo deterministic and (μ / ρ, λ) selection respectively. ...
Context 8
... the behavior is unpredictable which is sometimes advantageous in applications such as this. Figure 11 through Figure 14 shows a comparison between the proposed cryptography and cryptography with (μ / ρ, λ) selection. We can see that the Deterministic solution has overall low peaks after transmitter generation 15 and 1 in Figure 11 and Figure 13 respectively. Whereas there are abrupt maxima and minima for cryptography with Pseudo deterministic and (μ / ρ, λ) selection respectively. ...
Context 9
... there are abrupt maxima and minima for cryptography with Pseudo deterministic and (μ / ρ, λ) selection respectively. Figure 12 shows that cryptography with Pseudo deterministic and (μ / ρ, λ) selection exhibit more or less the same fitness contour. Pseudo deterministic GEA yields a solution of fitness 193 at transmitter generation 1 whereas cryptography with (μ / ρ, λ) selection yields a candidate solution of 170 fitness Figure 7. ...
Context 10
... of fitness of cipher text for population size 20 Figure 9. Comparison of convergence in cryptography with deterministic and pseudo-deterministic GEA for population size 40 Figure 10. Comparison of fitness of cipher text for population size 40 Figure 11. ...
Context 11
... of convergence in cryptography with deterministic and pseudo-deterministic GEA for population size 40 Figure 10. Comparison of fitness of cipher text for population size 40 Figure 11. Comparison of convergence in cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 20 Figure 12. ...
Context 12
... of fitness of cipher text for population size 40 Figure 11. Comparison of convergence in cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 20 Figure 12. Comparison of fitness of ciphertext on cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 20 Figure 13. ...
Context 13
... of convergence in cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 20 Figure 12. Comparison of fitness of ciphertext on cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 20 Figure 13. Comparison of convergence in cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 40 Figure 14. ...
Context 14
... of fitness of ciphertext on cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 20 Figure 13. Comparison of convergence in cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 40 Figure 14. Comparison of fitness of ciphertext in cryptography with deterministic GEA, pseudo-deterministic GEA and (μ / ρ, λ) selection mechanism for population size 40 value. ...
Context 15
... the other hand, Deterministic GEA is not impressive in navigating the search space in comparison. Figure 14 again highlights that fitness of transmitted cipher text in Pseudo deterministic GEA is of overall good quality in comparison to the other two. Also the fitness landscape in cryptography with (μ / ρ, λ) shows that it does not evolve as effectively after generation 20 in comparison to the proposed cryptography. ...
Citations
... So, the information about the source has an important role in preventive maintenance. Apart from this application domain, the presence of noise impacts the performance of chaosbased communications, [36][37][38][39][40][41] chaos-based robotic navigation, [42][43][44] and chaotic time series prediction [45][46][47] since it hinders the capture of useful information. Therefore, it is vital to devise methods that can distinguish noise from deterministic chaos and its noise-corrupted version. ...
The problem of distinguishing deterministic chaos from non-chaotic dynamics has been an area of active research in time series analysis. Since noise contamination is unavoidable, it renders deterministic chaotic dynamics corrupted by noise to appear in close resemblance to stochastic dynamics. As a result, the problem of distinguishing noise-corrupted chaotic dynamics from randomness based on observations without access to the measurements of the state variables is difficult. We propose a new angle to tackle this problem by formulating it as a multi-class classification task. The task of classification involves allocating the observations/measurements to the unknown state variables in order to find the nature of these unobserved internal state variables. We employ signal and image processing based methods to characterize the different system dynamics. A deep learning technique using a state-of-the-art image classifier known as the Convolutional Neural Network (CNN) is designed to learn the dynamics. The time series are transformed into textured images of spectrogram and unthresholded recurrence plot (UTRP) for learning stochastic and deterministic chaotic dynamical systems in noise. We have designed a CNN that learns the dynamics of systems from the joint representation of the textured patterns from these images, thereby solving the problem as a pattern recognition task. The robustness and scalability of our approach is evaluated at different noise levels. Our approach demonstrates the advantage of applying the dynamical properties of chaotic systems in the form of joint representation of UTRP images along with spectrogram to improve learning dynamical systems in colored noise.
... In this scenario, the block ciphers can utilize chaos based cryptosystems along with cycles of chaotic maps [31] and chaotic round functions [32]. Additionally, stream ciphers use the chaos based pseudo-arbitrary bit generators [33]. ...
With the inclusion of mobile devices and ubiquitous connectivity of smart devices in Internet of Things (IoT), secure key management is mandatory to ensure privacy for information exchange. In this regard, the multiparty key establishment schemes achieve better security strength by taking shared parameters from neighboring member nodes to calculate the key. The similar multiparty mechanism can be adopted among other hierarchical nodes including head node, server and gateway node. Moreover, session keys can also be set up in a similar manner. The main problem in multiparty password-based authentication schemes is the computation of extensively hard problem that limits it to three parties and N-party is quite more complex or infeasible. This paper presents a novel Distributed Multiparty Keying (DMK) scheme where chaotic maps are used to provide one-way hashing and Chebyshev polynomial (CP) are used for establishing a common multiparty key. In our work, Phase-I covers keying among trusted server and group heads and Phase-II elaborates the key establishment among smart devices and their group heads. The scheme is verified through the formal specification and security analysis using Rubin Logic for inter-group key establishment scenario. We have validated the intra-group and inter-group key establishment by doing extensive simulations in NS 2.35. Moreover, a testbed is setup for GH to server level authentication and key establishment. Results prove the supremacy of our scheme as compared to preliminaries in terms of computation cost, communication cost and resilience.
... The former is based on the techniques of control [32] and synchronization [21,26] of chaos. Whereas digital chaos based cryptosystems can be realized by: block ciphers based on forward and/or reverse iterations of chaotic maps [37], block ciphers based on chaotic round functions [22], stream ciphers implementing chaos based pseudo random bit generators (PRBG) [29]. There are several ways through which analog chaos based cryptosystems can be realized such as: chaotic masking [15], chaotic modulation [18] chaotic switching [38] inverse system approach. ...
Robustness of cellular networks in case of handling faults still remains a daunting task. Mobile computing technology has rapidly become can indispensable mode in various e-commerce transactions along with voice and video communication. With these facilities comes the threat of security and integrity of information which are equally important to be tackled as the seamless transfer of data from remote locations to other remote or fixed locations and has currently drawn significant attention in the research community. The traditional ways of cryptography have been exhaustively explored during the past few decades. This chapter seeks ways to explore the implementation of a complex dynamic system in cryptographic application for another dynamic system. Mobile communications deals with a dynamic system characterized with intermittent disconnections. In the light of these facts, this work introduces fault tolerance technique with secure checkpointing and message logging while handling of mobile disconnections.We propose a secure communication technique and an efficient key management methodology for mobile computing environment based on the chaotic sequences generated by an optical chaos system with high fluctuating chaotic orbits. To the best of our knowledge, very little work has been done based on chaos cryptography in mobile computing. We propose a) A hybrid message logging and asynchronous checkpointing scheme at receiver’s end with an improved performance where messages exchanged by Mobile Hosts (MH) are logged at the stable base station b) The proposed message logging is made secure by introducing cryptography devised from a two-way coupled chaotic laser system derived from Maxwell Bloch’s equations. The entire process serves a dual purpose. Firstly, chaos synchronization would form a secure channel through which physical transfer of the private keys would be completely eliminated. Thereby, reducing the computational overhead incurred during the complex way of exchanging keys in Diffie Hellman Key Exchange (DHKE) protocol. Secondly,the inherent randomness and deterministic properties of chaotic system renders the scheme immune to major attacks. The entire scheme has been labeled as Chaos Key Exchange (CKE) method which uses the chaotic sequences generated by a synchronized chaotic laser system as the private keys to be used in cryptographic purpose. As a consequence, CKE forms as an efficient key management system used during encrypting messages involving voluminous data such as multimedia and images. The proposed logging process as well as the communication of messages has been made secure by applying CKE method.CKE has been demonstrated by encoding an image which is transmitted over a secure channel.The ergodicity of the chaotic system adds the necessary confusion and diffusion properties required for efficient cryptography.Simulation result highlight the merit of the scheme which precisely recovers the messages at the receiver section thereby proving the robustness of the scheme which is efficiently extended to achieve secure logging of the messages.
... This method of chaos cryptography is the outcome of the phenomenal work of chaos synchronization demonstrated by Pecora and Carroll [1]. This bifurcation from the traditional methods of encryption realized with the synchronization of two coupled chaotic trajectories opened a whole new dimension for cryptographic applications [2][3][4][5][6][7]. Its principle of operation relies primarily on the fact that the chaotic nonlinear oscillator plays the role of a broadband signal generator and the chaotic waveform can mask the information. ...
... Through the modulo operation, the length is restricted to the range [0, M ] or [1, M +1]. These processed keys are of the same length as that of the message and are used exactly once and therefore this organization is theoretically unbroken [4]. So, the advantage of the Vignere cipher is reaped by our scheme.Then in order to encode an image of length M × N , we convert the set Y 1 and Y 2 into a chaotic sequence K 1 and K 2 respectively containing the M × N elements as that of the plain image P of dimension M × N . ...
Optical chaos is a topic of current research characterized by
high-dimensional nonlinearity which is attributed to the delay-induced
dynamics, high bandwidth and easy modular implementation of optical feedback.
In light of these facts, which adds enough confusion and diffusion properties
for secure communications, we explore the synchronization phenomena in
spatiotemporal semiconductor laser systems. The novel system is used in a
two-phase colored image encryption process. The high-dimensional chaotic
attractor generated by the system produces a completely randomized chaotic time
series, which is ideal in the secure encoding of messages. The scheme thus
illustrated is a two-phase encryption method, which provides sufficiently high
confusion and diffusion properties of chaotic cryptosystem employed with unique
data sets of processed chaotic sequences. In this novel method of cryptography,
the chaotic phase masks are represented as images using the chaotic sequences
as the elements of the image. The scheme drastically permutes the positions of
the picture elements. The next additional layer of security further alters the
statistical information of the original image to a great extent along the
three-color planes. The intermediate results during encryption demonstrate the
infeasibility for an unauthorized user to decipher the cipher image. Exhaustive
statistical tests conducted validate that the scheme is robust against noise
and resistant to common attacks due to the double shield of encryption and the
infinite dimensionality of the relevant system of partial differential
equations.
... achieved by using chaotic carriers obtained from semiconductor lasers to encode an information. Chaos Cryptography [3,4,5,6,7], an offshoot of traditional cryptography is realized with the synchronization of two coupled chaotic trajectories. The genesis of chaos based cryptography is attributed to the pioneering work of chaos synchronization by Pecora and Carroll [8]. ...
... Moreover, for absolute secrecy the keys space should not be reused. The scheme adheres to Kirchoff's principle and the arrangement of the key set forms a Vignere cipher which is theoretically unbroken [7]. At synchronization, say at t=t max =20 (dimensionless unit), the system will remain the same for any t i > t max at which the error between E ±1 and E ±2 will approach zero. ...
The Optical chaotic systems, with infinite dimensionality, have gained a lot of attention for communication and cryptographic purposes. The semiconductor devices act as a cryptosystem with high bandwidth. We explore the synchronization phenomenon between two spatio-temporal chaotic semi conductor lasers with bi-directional coupling. The coupling facilitates two way simultaneous communication. The ease of modular implementation of optical feedback together with the randomness and ergodic properties of the infinite dimensional systems produces completely randomized chaotic time series. Such a system is an ideal candidate for cryptographic purposes of large streams of data such as a digital image. The system renders enough confusion and diffusion properties to the transmitted gray scaled image rendering the statistically disordered cipher image totally incoherent from the original message. Simulation result and statistical tests demonstrate the merit of the system in achieving robust and secure cryptography with deterministic chaos aiding in the correct recovery of the encoded image.
In this work, we propose to enable security mechanisms on a chaotic
communication system based upon common noise induced synchronization
between two time-delayed semiconductor laser systems. The cryptosystem
subjected to the common additive Gaussian colored noise undergoes a
transition to follow identical trajectories. An investigation of the
system together with a novel scheme for authentication based message
encryption process are presented. The encrypted message is also sent
over a public channel, while the key is never transmitted at all. The
advantage of the scheme is its security, based on the authentication and
asymmetric encryption. Extended statistical tests with the proposed two
phase cryptography scheme demonstrate the efficiency of the system being
robust and tolerant to different types of statistical attacks.
This work aims to demonstrate the effect of synchronization phenomena in chaotic laser systems described by modified Lang–Kobayashi's (L–K) delay differential equations. The synchronized system considered for numerical simulations and for cryptography consists of identical semiconductor lasers operating in single longitudinal mode. The two lasers are bidirectionally coupled by linear optical feedback. As this is essential in simultaneous transmission of messages, we have applied the corresponding coupled chaotic dynamics to secure communications. An investigation of the system together with a novel scheme for digital cryptography and visual recurrence analysis (VRA) of the chaotic time series are presented. Extended statistical tests with the proposed two phase scheme demonstrate the efficiency of these infinite dimensional systems in being tolerant to different types of statistical attacks. The result emphasizes the merits of the uncertainty and high dimensionality of optical chaos system in duplex high speed secure communications.
