Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem

Details Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem

2008-06-05

arxiv.org/abs/0806.0931v1

Nonlinear Sciences

Chaotic Dynamics

Scientific paper

10.1103/PhysRevLett.101.084102

The synchronization process of two mutually delayed coupled deterministic chaotic maps is demonstrated both analytically and numerically. The synchronization is preserved when the mutually transmitted signal is concealed by two commutative private filters that are placed on each end of the communication channel. We demonstrate that when the transmitted signal is a convolution of the truncated time delayed output signals or some powers of the delayed output signals synchronization is still maintained. The task of a passive attacker is mapped onto Hilbert's tenth problem, solving a set of nonlinear Diophantine equations, which was proven to be in the class of NP-Complete problems. This bridge between two different disciplines, synchronization in nonlinear dynamical processes and the realm of the NPC problems, opens a horizon for a new type of secure public-channel protocols.

Affiliated with

Also associated with

No associations

Rating

Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127888