Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA framework for public-channel cryptography using chaotic lasers
208
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Two mutually coupled chaotic diode lasers with individual external feedback, are shown to establish chaos synchronization in the low-frequency fluctuations regime. A third laser with identical external feedback but coupled unidirectionally to one of the pair does not synchronize. Both experiments and simulations reveal the existence of a window of parameters for which synchronization by mutual coupling is possible but synchronization by unidirectional coupling is not. This parameter space forms the basis of a proposed public-channel cryptographic scheme and is robust to various possible attacks.
rate research
Read More
The dynamics of two mutually coupled chaotic diode lasers are investigated experimentally and numerically. By adding self feedback to each laser, stable isochronal synchronization is established. This stability, which can be achieved for symmetric operation, is essential for constructing an optical public-channel cryptographic system. The experimental results on diode lasers are well described by rate equations of coupled single mode lasers.
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 laser 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.
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.
Security in quantum cryptography is continuously challenged by inventive attacks targeting the real components of a cryptographic setup, and duly restored by new counter-measures to foil them. Due to their high sensitivity and complex design, detectors are the most frequently attacked components. Recently it was shown that two-photon interference from independent light sources can be exploited to avoid the use of detectors at the two ends of the communication channel. This new form of detection-safe quantum cryptography, called Measurement-Device-Independent Quantum Key Distribution (MDI-QKD), has been experimentally demonstrated, but with modest delivered key rates. Here we introduce a novel pulsed laser seeding technique to obtain high-visibility interference from gain-switched lasers and thereby perform quantum cryptography without detector vulnerabilities with unprecedented bit rates, in excess of 1 Mb/s. This represents a 2 to 6 orders of magnitude improvement over existing implementations and for the first time promotes the new scheme as a practical resource for quantum secure communications.
We present the Foundational Cryptography Framework (FCF) for developing and checking complete proofs of security for cryptographic schemes within a proof assistant. This is a general-purpose framework that is capable of modeling and reasoning about a wide range of cryptographic schemes, security definitions, and assumptions. Security is proven in the computational model, and the proof provides concrete bounds as well as asymptotic conclusions. FCF provides a language for probabilistic programs, a theory that is used to reason about programs, and a library of tactics and definitions that are useful in proofs about cryptography. The framework is designed to leverage fully the existing theory and capabilities of the Coq proof assistant in order to reduce the effort required to develop proofs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
