اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPublic Channel Cryptography: Chaos Synchronization and Hilberts Tenth Problem
136
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 Hilberts 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.
قيم البحث
اقرأ أيضاً
We study the mutual coupling of chaotic lasers and observe both experimentally and in numeric simulations, that there exists a regime of parameters for which two mutually coupled chaotic lasers establish isochronal synchronization, while a third lase
r coupled unidirectionally to one of the pair, does not synchronize. We then propose a cryptographic scheme, based on the advantage of mutual-coupling over unidirectional coupling, where all the parameters of the system are public knowledge. We numerically demonstrate that in such a scheme the two communicating lasers can add a message signal (compressed binary message) to the transmitted coupling signal, and recover the message in both directions with high fidelity by using a mutual chaos pass filter procedure. An attacker however, fails to recover an errorless message even if he amplifies the coupling signal.
We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilberts tenth problem, Godels incompleteness theorem, and Turings halting probl
em. By slightly strengthening the property $P$, we get Tarskis definability theorem, namely that truth is not first order definable. The property $P$ together with a Cantors diagonalization process emphasizes that all the above theorems are a variation on a theme, that of self reference and diagonalization combined. We relate our results to self referential paradoxes, including a formalisation of the Liar paradox, and fixed point theorems. We also discuss the property $P$ for arbitrary rings. We give a survey on Hilberts tenth problem for quadratic rings and for the rationals pointing the way to ongoing research in main stream mathematics involving recursion theory, definability in model theory, algebraic geometry and number theory.
Small networks of chaotic units which are coupled by their time-delayed variables, are investigated. In spite of the time delay, the units can synchronize isochronally, i.e. without time shift. Moreover, networks can not only synchronize completely,
but can also split into different synchronized sublattices. These synchronization patterns are stable attractors of the network dynamics. Different networks with their associated behaviors and synchronization patterns are presented. In particular, we investigate sublattice synchronization, symmetry breaking, spreading chaotic motifs, synchronization by restoring symmetry and cooperative pairwise synchronization of a bipartite tree.
We relate the decidability problem for BS with unordered cartesian product with Hilberts Tenth problem and prove that BS with unordered cartesian product is NP-complete.
We extend the concept of generalized synchronization of chaos, a phenomenon that occurs in driven dynamical systems, to the context of autonomous spatiotemporal systems. It means a situation where the chaotic state variables in an autonomous system c
an be synchronized to each other but not to a coupling function defined from them. The form of the coupling function is not crucial; it may not depend on all the state variables nor it needs to be active for all times for achieving generalized synchronization. The procedure is based on the analogy between a response map subject to an external drive acting with a probability p and an autonomous system of coupled maps where a global interaction between the maps takes place with this same probability. It is shown that, under some circumstances, the conditions for stability of generalized synchronized states are equivalent in both types of systems. Our results reveal the existence of similar minimal conditions for the emergence of generalized synchronization of chaos in driven and in autonomous spatiotemporal systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
