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

Ido Kanter, Evi Kopelowitz, and Wolfgang Kinzel
Phys. Rev. Lett. 101, 084102 – Published 22 August 2008

Abstract

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 signals are concealed by two commutative private filters, a convolution of the truncated time-delayed output signals or some powers of the delayed output signals. 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 [problems that are both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP problem can be translated into this problem)]. This bridge between nonlinear dynamics and NP-complete problems opens a horizon for new types of secure public-channel protocols.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 14 February 2008

DOI:https://doi.org/10.1103/PhysRevLett.101.084102

©2008 American Physical Society

Authors & Affiliations

Ido Kanter1, Evi Kopelowitz1, and Wolfgang Kinzel2

  • 1Department of Physics, Bar-Ilan University, Ramat-Gan, 52900 Israel
  • 2Institute for Theoretical Physics, University of Würzburg, Am Hubland, 97074 Würzburg, Germany

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 101, Iss. 8 — 22 August 2008

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×