Public-channel cryptography using chaos synchronization

Abstract

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.

4 figures

References in corpus (4)

• Delays, connection topology, and synchronization of coupled chaotic maps
• Secure exchange of information by synchronization of neural networks
• Mutual learning in a tree parity machine and its application to cryptography
• Cooperating Attackers in Neural Cryptography

Cited by in corpus (9)

• Stable isochronal synchronization of mutually coupled chaotic lasers
• Public-channel cryptography based on mutual chaos pass filters
• Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem
• Synchronization of Mutually Versus Unidirectionally Coupled Chaotic Semiconductor Lasers
• Comment on novel public key encryption technique based on multiple chaotic systems
• Patterns of Chaos Synchronization
• Spiking Optical Patterns and Synchronization
• Neural Synchronization and Cryptography
• Chaos Synchronization with Dynamic Filters: Two Way is Better Than One Way