scholarly journals Robust Frame Synchronization Scheme for Continuous-Variable Quantum Key Distribution with Simple Process

Entropy ◽  
2019 ◽  
Vol 21 (12) ◽  
pp. 1146
Author(s):  
Rui Chen ◽  
Peng Huang ◽  
Dengwen Li ◽  
Yiqun Zhu ◽  
Guihua Zeng
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Continuous Variable ◽  
Quality Data ◽  
Data Synchronization ◽  
Frame Synchronization ◽  
Novel Approach ◽  
Secret Keys ◽  
Shared Secret ◽  
Synchronization Scheme

In continuous-variable quantum key distribution (CVQKD) systems, high-quality data synchronization between two legitimate parties, Alice and Bob, is the premise of the generation of shared secret keys. Synchronization with specially designed frames is an efficient way, but it requires special modulating devices to generate these special frames. Moreover, the extra requirement of special modulating devices makes it technically impossible for some passive preparation schemes. We propose a novel approach to realize synchronization in this paper, which is different from those special-frame-based methods. In our proposed scheme, Alice publishes parts of the original signals as the synchronization frames and Bob takes these frames to perform the synchronization algorithm. Besides, a synchronization feature is applied to deal with phase shifts. The simulation results based on practical data demonstrate that the proposed synchronization scheme not only maintains a high success rate but simplifies the data processing flow at the same time, which dramatically reduces the computational complexity.

scholarly journals High performance frame synchronization for continuous variable quantum key distribution systems

2015 ◽  
Vol 23 (17) ◽  
pp. 22190 ◽  
Author(s):  
Dakai Lin ◽  
Peng Huang ◽  
Duan Huang ◽  
Chao Wang ◽  
Jinye Peng ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
High Performance ◽  
Distribution Systems ◽  
Key Distribution ◽  
Continuous Variable ◽  
Frame Synchronization ◽  
Performance Frame

scholarly journals Proof-of-principle demonstration of semi-quantum key distribution based on the Mirror protocol

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Siyu Han ◽  
Yutao Huang ◽  
Shang Mi ◽  
Xiaojuan Qin ◽  
Jindong Wang ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Future Research ◽  
Experimental Demonstration ◽  
Phase Encoding ◽  
Quantum Bit ◽  
Selective Modulation ◽  
Secret Keys ◽  
Shared Secret ◽  
Proof Of Principle

AbstractSemi-quantum key distribution (SQKD) is used to establish a string of shared secret keys between a quantum party and a classical party. Here, we report the first proof-of-principle experimental demonstration of SQKD based on the Mirror protocol, which is the most experimentally feasible SQKD protocol, and equipped with time-phase encoding scheme employing the method of selective modulation. The experiment was performed at a repetition frequency of 62.5 MHz and a high raw key rate arrived at 69.8 kbps, and the average quantum bit error rate was found to be 4.56% and 2.78% for the “SWAP-x-Z” ($\mathrm{x}\in \{01,10\}$ x ∈ { 01 , 10 } ) and the “CTRL-X”, respectively. The results demonstrate the feasibility of our system, and this study is helpful for future research on SQKD experiments.

scholarly journals Simple security proofs for continuous variable quantum key distribution with intensity fluctuating sources

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Chenyang Li ◽  
Li Qian ◽  
Hoi-Kwong Lo
Keyword(s):  
Quantum Key Distribution ◽  
Distribution Systems ◽  
Finite Size ◽  
Key Distribution ◽  
Continuous Variable ◽  
Discrete Variable ◽  
Security Proofs ◽  
Security Proof ◽  
Main Technique ◽  
Secret Keys

AbstractDespite tremendous theoretical and experimental progress in continuous variable (CV) quantum key distribution (QKD), the security has not been rigorously established for most current continuous variable quantum key distribution systems that have imperfections. Among these imperfections, intensity fluctuation is one of the principal problems affecting security. In this paper, we provide simple security proofs for continuous variable quantum key distribution systems with intensity fluctuating sources. Specifically, depending on device assumptions in the source, the imperfect systems are divided into two general cases for security proofs. In the most conservative case, we prove the security based on the tagging idea, which is a main technique for the security proof of discrete variable quantum key distribution. Our proofs are simple to implement without any hardware adjustment for current continuous variable quantum key distribution systems. Also, we show that our proofs are able to provide secure secret keys in the finite-size scenario.

The Synchronization Scheme and Implementation of Continuous Variable Quantum Key Distribution System

2016 ◽  
Vol 22 (1) ◽  
pp. 43-49
Author(s):  
方双红 FANG Shuang-hong ◽  
彭进业 PENG Jin-ye ◽  
黄鹏 HUANG Peng ◽  
刘璐 LIU Lu ◽  
曹正文 CAO Zheng-wen ◽  
...  
Keyword(s):  
Distribution System ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Continuous Variable ◽  
Synchronization Scheme

scholarly journals Device-independent quantum key distribution with random key basis

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
René Schwonnek ◽  
Koon Tong Goh ◽  
Ignatius W. Primaatmaja ◽  
Ernest Y.-Z. Tan ◽  
Ramona Wolf ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Bell Inequality ◽  
Key Distribution ◽  
Theory And Practice ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Experimental Parameters ◽  
Secret Keys ◽  
Simple Variant ◽  
First Time

AbstractDevice-independent quantum key distribution (DIQKD) is the art of using untrusted devices to distribute secret keys in an insecure network. It thus represents the ultimate form of cryptography, offering not only information-theoretic security against channel attacks, but also against attacks exploiting implementation loopholes. In recent years, much progress has been made towards realising the first DIQKD experiments, but current proposals are just out of reach of today’s loophole-free Bell experiments. Here, we significantly narrow the gap between the theory and practice of DIQKD with a simple variant of the original protocol based on the celebrated Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. By using two randomly chosen key generating bases instead of one, we show that our protocol significantly improves over the original DIQKD protocol, enabling positive keys in the high noise regime for the first time. We also compute the finite-key security of the protocol for general attacks, showing that approximately 108–1010 measurement rounds are needed to achieve positive rates using state-of-the-art experimental parameters. Our proposed DIQKD protocol thus represents a highly promising path towards the first realisation of DIQKD in practice.

scholarly journals An FPGA-Based LDPC Decoder With Ultra-Long Codes for Continuous-Variable Quantum Key Distribution

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 47687-47697
Author(s):  
Shen-Shen Yang ◽  
Jian-Qiang Liu ◽  
Zhen-Guo Lu ◽  
Zeng-Liang Bai ◽  
Xu-Yang Wang ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Continuous Variable ◽  
Ldpc Decoder

scholarly journals A novel error correction protocol for continuous variable quantum key distribution

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Kadir Gümüş ◽  
Tobias A. Eriksson ◽  
Masahiro Takeoka ◽  
Mikio Fujiwara ◽  
Masahide Sasaki ◽  
...  
Keyword(s):  
Error Correction ◽  
Quantum Key Distribution ◽  
Ldpc Codes ◽  
Key Distribution ◽  
Continuous Variable ◽  
Early Termination ◽  
Parity Check ◽  
Secret Key ◽  
Ldpc Decoder ◽  
And Performance

AbstractReconciliation is a key element of continuous-variable quantum key distribution (CV-QKD) protocols, affecting both the complexity and performance of the entire system. During the reconciliation protocol, error correction is typically performed using low-density parity-check (LDPC) codes with a single decoding attempt. In this paper, we propose a modification to a conventional reconciliation protocol used in four-state protocol CV-QKD systems called the multiple decoding attempts (MDA) protocol. MDA uses multiple decoding attempts with LDPC codes, each attempt having fewer decoding iteration than the conventional protocol. Between each decoding attempt we propose to reveal information bits, which effectively lowers the code rate. MDA is shown to outperform the conventional protocol in regards to the secret key rate (SKR). A 10% decrease in frame error rate and an 8.5% increase in SKR are reported in this paper. A simple early termination for the LDPC decoder is also proposed and implemented. With early termination, MDA has decoding complexity similar to the conventional protocol while having an improved SKR.

Sign in / Sign up

Export Citation Format

Share Document