arXiv subjects

Ido Kanter

Publications and source records attributed to Ido Kanter.

At least 73 records · Page 4Linked to original sources

arXiv2007

Chaos Synchronization with Dynamic Filters: Two Way is Better Than One Way

Two chaotic systems which interact by mutually exchanging a signal built from their delayed internal variables, can synchronize. A third unit may be able to record and to manipulate the exchanged signal. Can the third unit synchronize to the common chaotic trajectory, as well? If all parameters of the system are public, a proof is given that the recording system can synchronize as well. However, if the two interacting systems use private commutative filters to generate the exchanged signal, a driven system cannot synchronize. It is shown that with dynamic private filters the chaotic trajectory even cannot be calculated. Hence two way (interaction) is more than one way (drive). The implication of this general result to secret communication with chaos synchronization is discussed.

nlin.CD↗

arXiv2007

Dynamics of neural cryptography

Synchronization of neural networks has been used for novel public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive and repulsive stochastic forces. Thus it can be described well by a random walk model for the overlap between participating neural networks. For that purpose transition probabilities and scaling laws for the step sizes are derived analytically. Both these calculations as well as numerical simulations show that bidirectional interaction leads to full synchronization on average. In contrast, successful learning is only possible by means of fluctuations. Consequently, synchronization is much faster than learning, which is essential for the security of the neural key-exchange protocol. However, this qualitative difference between bidirectional and unidirectional interaction vanishes if tree parity machines with more than three hidden units are used, so that those neural networks are not suitable for neural cryptography. In addition, the effective number of keys which can be generated by the neural key-exchange protocol is calculated using the entropy of the weight distribution. As this quantity increases exponentially with the system size, brute-force attacks on neural cryptography can easily be made unfeasible.

cond-mat.dis-nn↗

arXiv2007

Spiking Optical Patterns and Synchronization

We analyze the time resolved spike statistics of a solitary and two mutually interacting chaotic semiconductor lasers whose chaos is characterized by apparently random, short intensity spikes. Repulsion between two successive spikes is observed, resulting in a refractory period which is largest at laser threshold. For time intervals between spikes greater than the refractory period, the distribution of the intervals follows a Poisson distribution. The spiking pattern is highly periodic over time windows corresponding to the optical length of the external cavity, with a slow change of the spiking pattern as time increases. When zero-lag synchronization between the two lasers is established, the statistics of the nearly perfectly matched spikes are not altered. The similarity of these features to those found in complex interacting neural networks, suggests the use of laser systems as simpler physical models for neural networks.

physics.optics↗

arXiv2007

Sublattice synchronization of chaotic networks with delayed couplings

Synchronization of chaotic units coupled by their time delayed variables are investigated analytically. A new type of cooperative behavior is found: sublattice synchronization. Although the units of one sublattice are not directly coupled to each other, they completely synchronize without time delay. The chaotic trajectories of different sublattices are only weakly correlated but not related by generalized synchronization. Nevertheless, the trajectory of one sublattice is predictable from the complete trajectory of the other one. The spectra of Lyapunov exponents are calculated analytically in the limit of infinite delay times, and phase diagrams are derived for different topologies.

nlin.CD↗

arXiv2006

Synchronization of mutually coupled chaotic lasers in the presence of a shutter

Two mutually coupled chaotic diode lasers exhibit stable isochronal synchronization in the presence of self feedback. When the mutual communication between the lasers is discontinued by a shutter and the two uncoupled lasers are subject to self-feedback only, the desynchronization time is found to scale as $A_dτ$ where $A_d>1$ and $τ$ corresponds to the optical distance between the lasers. Prior to synchronization, when the two lasers are uncorrelated and the shutter between them is opened, the synchronization time is found to be much shorter, though still proportional to $τ$. As a consequence of these results, the synchronization is not significantly altered if the shutter is opend/closed faster than the desynchronization time. Experiments in which the coupling between two chaotic-synchronized diode lasers is modulated with an electro-optic shutter are found to be consistent with the results of numerical simulations.

nlin.CD↗

arXiv2006

Genetic attack on neural cryptography

Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold for the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.

cond-mat.dis-nn↗

arXiv2006

Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources

A sequential updating scheme (SUS) for belief propagation (BP) decoding of LDPC codes over Galois fields, $GF(q)$, and correlated Markov sources is proposed, and compared with the standard parallel updating scheme (PUS). A thorough experimental study of various transmission settings indicates that the convergence rate, in iterations, of the BP algorithm (and subsequently its complexity) for the SUS is about one half of that for the PUS, independent of the finite field size $q$. Moreover, this 1/2 factor appears regardless of the correlations of the source and the channel's noise model, while the error correction performance remains unchanged. These results may imply on the 'universality' of the one half convergence speed-up of SUS decoding.

cs.IT↗

arXiv2006

Synchronization of Mutually Versus Unidirectionally Coupled Chaotic Semiconductor Lasers

Synchronization dynamics of mutually coupled chaotic semiconductor lasers are investigated experimentally and compared to identical synchronization of unidirectionally coupled lasers. Mutual coupling shows high quality synchronization in a broad range of self-feedback and coupling strengths. It is found to be tolerant to significant parameter mismatch which for unidirectional coupling would result in loss of synchronization. The advantages of mutual coupling are emphasized in light of its potential use in chaos communications.

nlin.CD↗

arXiv2006

Public-channel cryptography based on mutual chaos pass filters

We study the mutual coupling of chaotic lasers and observe both experimentally and in numeric simulations, that there exists a regime of parameters for which two mutually coupled chaotic lasers establish isochronal synchronization, while a third laser coupled unidirectionally to one of the pair, does not synchronize. We then propose a cryptographic scheme, based on the advantage of mutual-coupling over unidirectional coupling, where all the parameters of the system are public knowledge. We numerically demonstrate that in such a scheme the two communicating lasers can add a message signal (compressed binary message) to the transmitted coupling signal, and recover the message in both directions with high fidelity by using a mutual chaos pass filter procedure. An attacker however, fails to recover an errorless message even if he amplifies the coupling signal.

cond-mat.stat-mech↗

arXiv2006

Optimum Asymptotic Multiuser Efficiency of Pseudo-Orthogonal Randomly Spread CDMA

A $K$-user pseudo-orthogonal (PO) randomly spread CDMA system, equivalent to transmission over a subset of $K'\leq K$ single-user Gaussian channels, is introduced. The high signal-to-noise ratio performance of the PO-CDMA is analyzed by rigorously deriving its asymptotic multiuser efficiency (AME) in the large system limit. Interestingly, the $K'$-optimized PO-CDMA transceiver scheme yields an AME which is practically equal to 1 for system loads smaller than 0.1 and lower bounded by 1/4 for increasing loads. As opposed to the vanishing efficiency of linear multiuser detectors, the derived efficiency is comparable to the ultimate CDMA efficiency achieved for the intractable optimal multiuser detector.

cs.IT↗

arXiv2005

Stable isochronal synchronization of mutually coupled chaotic lasers

The dynamics of two mutually coupled chaotic diode lasers are investigated experimentally and numerically. By adding self feedback to each laser, stable isochronal synchronization is established. This stability, which can be achieved for symmetric operation, is essential for constructing an optical public-channel cryptographic system. The experimental results on diode lasers are well described by rate equations of coupled single mode lasers.

cond-mat.dis-nn↗

arXiv2005

From finite-system entropy to entropy rate for a Hidden Markov Process

A recent result presented the expansion for the entropy rate of a Hidden Markov Process (HMP) as a power series in the noise variable $\eps$. The coefficients of the expansion around the noiseless ($\eps = 0$) limit were calculated up to 11th order, using a conjecture that relates the entropy rate of a HMP to the entropy of a process of finite length (which is calculated analytically). In this communication we generalize and prove the validity of the conjecture, and discuss the theoretical and practical consequences of our new theorem.

cs.IT↗

arXiv2005

Taylor series expansions for the entropy rate of Hidden Markov Processes

Finding the entropy rate of Hidden Markov Processes is an active research topic, of both theoretical and practical importance. A recently used approach is studying the asymptotic behavior of the entropy rate in various regimes. In this paper we generalize and prove a previous conjecture relating the entropy rate to entropies of finite systems. Building on our new theorems, we establish series expansions for the entropy rate in two different regimes. We also study the radius of convergence of the two series expansions.

cs.IT↗

arXiv2005

On the Achievable Information Rates of CDMA Downlink with Trivial Receivers

A noisy CDMA downlink channel operating under a strict complexity constraint on the receiver is introduced. According to this constraint, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. This channel setting, allowing the use of the simplest receiver scheme, seems to be worthless, making reliable communication at any rate impossible. However, recently this communication paradigm was shown to yield valuable information rates in the case of a noiseless channel. This finding calls for the investigation of this attractive complexity-constrained transmission scheme for the more practical noisy channel case. By adopting the statistical mechanics notion of metastable states of the renowned Hopfield model, it is proved that under a bounded noise assumption such complexity-constrained CDMA channel gives rise to a non-trivial Shannon-theoretic capacity, rigorously analyzed and corroborated using finite-size channel simulations. For unbounded noise the channel's outage capacity is addressed and specifically described for the popular additive white Gaussian noise.

cs.IT↗

arXiv2005

Capacity of Complexity-Constrained Noise-Free CDMA

An interference-limited noise-free CDMA downlink channel operating under a complexity constraint on the receiver is introduced. According to this paradigm, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. This channel setting, allowing the use of the simplest receiver scheme, seems to be worthless, making reliable communication at any rate impossible. We prove, by adopting statistical mechanics notion, that in the large-system limit such a complexity-constrained CDMA channel gives rise to a non-trivial Shannon-theoretic capacity, rigorously analyzed and corroborated using finite-size channel simulations.

cs.IT↗

arXiv2005

A framework for public-channel cryptography using chaotic lasers

Two mutually coupled chaotic diode lasers with individual external feedback, are shown to establish chaos synchronization in the low-frequency fluctuations regime. A third laser with identical external feedback but coupled unidirectionally to one of the pair does not synchronize. Both experiments and simulations reveal the existence of a window of parameters for which synchronization by mutual coupling is possible but synchronization by unidirectional coupling is not. This parameter space forms the basis of a proposed public-channel cryptographic scheme and is robust to various possible attacks.

cond-mat.dis-nn↗

arXiv2005

Public-channel cryptography using chaos synchronization

We present a key-exchange protocol that comprises two parties with chaotic dynamics that are mutually coupled and undergo a synchronization process, at the end of which they can use their identical dynamical state as an encryption key. The transferred coupling-signals are based non-linearly on time-delayed states of the parties, and therefore they conceal the parties' current state and can be transferred over a public channel. Synchronization time is linear in the number of synchronized digits alpha, while the probability for an attacker to synchronize with the parties drops exponentially with alpha. To achieve security with finite alpha we use a network.

cond-mat.other↗

arXiv2005

Neural cryptography with queries

Neural cryptography is based on synchronization of tree parity machines by mutual learning. We extend previous key-exchange protocols by replacing random inputs with queries depending on the current state of the neural networks. The probability of a successful attack is calculated for different model parameters using numerical simulations. The results show that queries restore the security against cooperating attackers. The success probability can be reduced without increasing the average synchronization time.

cond-mat.dis-nn↗