Public channel cryptography: Chaos synchronization and Hilbert's tenth problem

Physical Review Letters

Volumn 101, Issue 8, 2008, Pages

  Kanter, Ido ^a   Kopelowitz, Evi ^a   Kinzel, Wolfgang ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHAOS THEORY; CHAOTIC SYSTEMS; CRYPTOGRAPHY; DYNAMICS; MAPS; MATHEMATICAL TECHNIQUES; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; SYNCHRONIZATION;

CHANNEL PROTOCOLS; CHAOS SYNCHRONIZATION; CHAOTIC MAPS; DELAYED OUTPUT; DIOPHANTINE EQUATIONS; HILBERT'S TENTH PROBLEM; NON-LINEAR DYNAMICS; NONDETERMINISTIC POLYNOMIAL; NP PROBLEMS; NP-COMPLETE PROBLEMS; NP-HARD; SYNCHRONIZATION PROCESS; TRANSMITTED SIGNALS;

NONLINEAR EQUATIONS;

EID: 50249124821     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.101.084102     Document Type: Article

References (24)

1. H.G. Schuster and W. Just, Deterministic Chaos (Wiley VCH, New York, 2005).
2. A. Pikovsky, M. Rosenblum, and J. Kurths, Synchronization: A Universal Concept in Nonlinear Sciences (Cambridge Univ. Press, N.Y., 2001).
3. L.M. Pecora and T.L. Carroll, Phys. Rev. Lett. 64, 821 (1990). PRLTAO 0031-9007 10.1103/PhysRevLett.64.821
4. A. Abel and W. Scharz, Proc. IEEE 90, 691 (2002). IEEPAD 0018-9219 10.1109/JPROC.2002.1015002
5. G. Perez and H. Cerdeira, Phys. Rev. Lett. 74, 1970 (1995). PRLTAO 0031-9007 10.1103/PhysRevLett.74.1970
6. K.M. Short, Int. J. Bifurcation Chaos Appl. Sci. Eng. IJBEE4 0218-1274 4, 959 (1994). 10.1142/S021812749400068X
7. E. Klein, R. Mislovaty, I. Kanter, and W. Kinzel, Phys. Rev. E 72, 016214 (2005). PLEEE8 1063-651X 10.1103/PhysRevE.72.016214
8. G.D. VanWiggeren and R. Roy, Science 279, 1198 (1998). SCIEAS 0036-8075 10.1126/science.279.5354.1198
9. A. Argyris, D. Syvridis, L. Larger, V. Annovazzi-Lodi, P. Colet, I. Fischer, J. Garcia-Ojalvo, C.R. Mirasso, L. Pesquera, and K.A. Shore, Nature (London) 437, 343 (2005). NATUAS 0028-0836 10.1038/nature04275
10. E. Klein, N. Gross, E. Kopelowitz, M. Rosenbluh, W. Kinzel, L. Khaykovich, and I. Kanter, Phys. Rev. E 74, 046201 (2006). PLEEE8 1063-651X 10.1103/PhysRevE.74.046201
11. M. Rosen-Zvi, E. Klein, I. Kanter, and W. Kinzel, Phys. Rev. E PLEEE8 1063-651X 66, 066135 (2002). 10.1103/PhysRevE.66.066135
12. A. Klimov, A. Mityagin, and A. Shamir, ASIACRYPT 288-298 (2002).
13. I. Kanter, E. Kopelowitz, W. Kinzel, and J. Kestler, arXiv:0712.2712v1.
14. M.R. Garey and D.S. Johnson, Computers and Intractability (W. H. Freeman Corporation, New York, 1979).
15. M. Davis, Am. Math. Mon. AMMYAE 0002-9890 80, 233 (1973). 10.2307/2318447
16. http://mathworld.wolfram.com/DiophantineEquation.html, and references therein.
17. C.H. Papadimitriou, Computational Complexity (Addison Wesley, Reading, MA, 1994).
18. E.M. Gurari and O.H. Ibarra, J. Assoc. Comput. Mach. 26, 567 (1979). JACOAH 0004-5411 10.1145/322139.322152
19. J. Kestler, W. Kinzel, and I. Kanter, Phys. Rev. E 76, 035202 (2007). PLEEE8 1063-651X 10.1103/PhysRevE.76.035202
20. S. Lerpi, G. Giacomelli, A. Politi, and F.T. Arecchi, Physica D (Amsterdam) 70, 235 (1994). PDNPDT 0167-2789 10.1016/0167-2789(94)90016-7
21. Synchronization under a scenario of silence periods is based on the fact that resycnhronization time of two mutually coupled chaotic maps is shorter in comparison to desynchronization time, as was observed in I. Kanter, N. Gross, E. Klein, E. Kopelowitz, P. Yoskovits, L. Khaykovich, W. Kinzel, and M. Rosenbluh, Phys. Rev. Lett. 98, 154101 (2007). PRLTAO 0031-9007 10.1103/PhysRevLett.98. 154101
22. F. Takens, in Dynamical Systems and Turbulence (Warwick 1980), edited by, D.A. Rand, and, L.-S. Young, Lecture Notes in Mathematics Vol. 898 (Springer-Verlag, Berlin, 1980), pp. 366-381.
23. C.H. Papadimitriou, JACM 1075-5535 28, 765 (1981) proves that this problem is in NP. A proof that this problem is in NPC was offered by Uri Feige based on the following reduction from SAT. For every variable z in the input SAT formula, introduce two variables in the system of equations, z0 for a positive literal corresponding to the variable, z1 for a negative literal and add the equation z0+z1=3. This constraint forces exactly one of these literals to have value 1 (interpreted as "true") and the other to have value 2 (interpreted as "false"). For every clause Ci, add the equation stating that the sum of the literals in the clause plus a new variable ci is equal to twice the number of variables in the clause. This can be satisfied by setting ci to be equal to the number of satisfied literals in the clause, which is positive if and only if the formula is satisfiable. 10.1145/322276.322287
24. I. Borosh and A.S. Fraenkel, Math. Comput. MCMPAF 0025-5718 20, 107 (1966). 10.2307/2004274