pith. sign in

arxiv: cond-mat/0412613 · v2 · submitted 2004-12-22 · ❄️ cond-mat.other · cond-mat.dis-nn

Public-channel cryptography using chaos synchronization

classification ❄️ cond-mat.other cond-mat.dis-nn
keywords partiesalphasynchronizationstatetheytransferredachieveattacker
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.