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.Comment: 9 pages, 15 figures; typos correcte

Public channel cryptography by synchronization of neural networks and chaotic maps

Two different kinds of synchronization have been applied to cryptography: Synchronization of chaotic maps by one common external signal and synchronization of neural networks by mutual learning. By combining these two mechanisms, where the external signal to the chaotic maps is synchronized by the nets, we construct a hybrid network which allows a secure generation of secret encryption keys over a public channel. The security with respect to attacks, recently proposed by Shamir et al, is increased by chaotic synchronization.Comment: 4 page

Quantum authentication with key recycling

We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully authenticated, and recycle part of the key if tampering is detected. We give a full security proof that constructs the secure channel given only insecure noisy channels and a shared secret key. We also prove that the number of recycled key bits is optimal for this family of protocols, i.e., there exists an adversarial strategy to obtain all non-recycled bits. Previous works recycled less key and only gave partial security proofs, since they did not consider all possible distinguishers (environments) that may be used to distinguish the real setting from the ideal secure quantum channel and secret key resource.Comment: 38+17 pages, 13 figures. v2: constructed ideal secure channel and secret key resource have been slightly redefined; also added a proof in the appendix for quantum authentication without key recycling that has better parameters and only requires weak purity testing code

Plant invasion impacts on fungal community structure and function depends on soil warming and nitrogen enrichment

The impacts of invasive species on biodiversity may be mitigated or exacerbated by abiotic environmental changes. Invasive plants can restructure soil fungal communities with important implications for native biodiversity and nutrient cycling, yet fungal responses to invasion may depend on numerous anthropogenic stressors. In this study, we experimentally invaded a long-term soil warming and simulated nitrogen deposition experiment with the widespread invasive plant Alliaria petiolata (garlic mustard) and tested the responses of soil fungal communities to invasion, abiotic factors, and their interaction. We focused on the phytotoxic garlic mustard because it suppresses native mycorrhizae across forests of North America. We found that invasion in combination with warming, but not under ambient conditions or elevated nitrogen, significantly reduced soil fungal biomass and ectomycorrhizal relative abundances and increased relative abundances of general soil saprotrophs and fungal genes encoding for hydrolytic enzymes. These results suggest that warming potentially exacerbates fungal responses to plant invasion. Soils collected from uninvaded and invaded plots across eight forests spanning a 4 °C temperature gradient further demonstrated that the magnitude of fungal responses to invasion was positively correlated with mean annual temperature. Our study is one of the first empirical tests to show that the impacts of invasion on fungal communities depends on additional anthropogenic pressures and were greater in concert with warming than under elevated nitrogen or ambient conditions

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.Comment: 8 pages, 12 figures; section 5 amended, typos correcte

The Chemical and Dynamical Evolution of Isolated Dwarf Galaxies

Using a suite of simulations (Governato et al. 2010) which successfully produce bulgeless (dwarf) disk galaxies, we provide an analysis of their associated cold interstellar media (ISM) and stellar chemical abundance patterns. A preliminary comparison with observations is undertaken, in order to assess whether the properties of the cold gas and chemistry of the stellar components are recovered successfully. To this end, we have extracted the radial and vertical gas density profiles, neutral hydrogen velocity dispersion, and the power spectrum of structure within the ISM. We complement this analysis of the cold gas with a brief examination of the simulations' metallicity distribution functions and the distribution of alpha-elements-to-iron.Comment: To appear in the proceedings of the JENAM 2010 Symposium "Dwarf Galaxies: Keys to Galaxy Formation and Evolution" (Lisbon, 9-10 September 2010), P. Papaderos, S. Recchi, G. Hensler (eds.), Springer Verlag (2011), in pres

Quantum Nondemolition Monitoring of Universal Quantum Computers

The halt scheme for quantum Turing machines, originally proposed by Deutsch, is reformulated precisely and is proved to work without spoiling the computation. The ``conflict'' pointed out recently by Myers in the definition of a universal quantum computer is shown to be only apparent. In the context of quantum nondemolition (QND) measurement, it is also shown that the output observable, an observable representing the output of the computation, is a QND observable and that the halt scheme is equivalent to the QND monitoring of the output observable.Comment: 5 pages, RevTeX, no figures, revised, to appear in Phys. Rev. Let