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

@article{citeulike:3198110, 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.}, author = {Kanter, Ido and Kopelowitz, Evi and Kinzel, Wolfgang}, citeulike-article-id = {3198110}, citeulike-linkout-0 = {http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=PRLTAO000101000008084102000001&idtype=cvips&gifs=yes}, citeulike-linkout-1 = {http://link.aps.org/abstract/PRL/v101/e084102}, citeulike-linkout-2 = {http://dx.doi.org/10.1103/PhysRevLett.101.084102}, doi = {10.1103/PhysRevLett.101.084102}, journal = {Physical Review Letters}, keywords = {chaos, cryptography, synchronization}, number = {8}, posted-at = {2008-09-05 21:50:07}, priority = {2}, publisher = {APS}, title = {Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem}, url = {http://dx.doi.org/10.1103/PhysRevLett.101.084102}, volume = {101}, year = {2008} }

TY - JOUR ID - citeulike:3198110 L3 - citeulike-article-id:3198110 N2 - 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. IS - 8 JF - Physical Review Letters TI - Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem PB - APS VL - 101 KW - chaos KW - cryptography KW - synchronization AU - Kanter, Ido AU - Kopelowitz, Evi AU - Kinzel, Wolfgang PY - 2008/// UR - http://dx.doi.org/10.1103/PhysRevLett.101.084102 ER -