Abstract
To overcome the low reconciliation efficiency problem of Gaussian modulation (GM)-based-continuous variable (CV)-quantum key distribution (QKD), in this paper, we propose to use discretized GM (DGM)-based-CV-QKD. The proposed CV-QKD scheme has complexity and reconciliation efficiency similar to that of discrete modulation (DM)-based-CV-QKD and at the same time solves for the problem of the nonexistence of strict security proofs for the DM-CV-QKD under the collective attacks. We demonstrate that the 32-points-based DGM CV-QKD can closely approach the theoretical SKR-limit in medium and high channel losses regimes. On the other hand, the 64-points-based DGM CV-QKD scheme closely approaches the SKR-limit for all channel losses.
| Original language | English (US) |
|---|---|
| Article number | 8717649 |
| Pages (from-to) | 65342-65346 |
| Number of pages | 5 |
| Journal | IEEE Access |
| Volume | 7 |
| DOIs | |
| State | Published - Jan 1 2019 |
Fingerprint
Keywords
- continuous variable (CV)-QKD
- discrete modulation
- Gaussian modulation
- information reconciliation
- Quantum communication
- quantum key distribution (QKD)
- secret-key rate (SKR)
ASJC Scopus subject areas
- Computer Science(all)
- Materials Science(all)
- Engineering(all)
Cite this
On the Discretized Gaussian Modulation (DGM)- Based Continuous Variable-QKD. / Djordjevic, Ivan B.
In: IEEE Access, Vol. 7, 8717649, 01.01.2019, p. 65342-65346.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - On the Discretized Gaussian Modulation (DGM)- Based Continuous Variable-QKD
AU - Djordjevic, Ivan B
PY - 2019/1/1
Y1 - 2019/1/1
N2 - To overcome the low reconciliation efficiency problem of Gaussian modulation (GM)-based-continuous variable (CV)-quantum key distribution (QKD), in this paper, we propose to use discretized GM (DGM)-based-CV-QKD. The proposed CV-QKD scheme has complexity and reconciliation efficiency similar to that of discrete modulation (DM)-based-CV-QKD and at the same time solves for the problem of the nonexistence of strict security proofs for the DM-CV-QKD under the collective attacks. We demonstrate that the 32-points-based DGM CV-QKD can closely approach the theoretical SKR-limit in medium and high channel losses regimes. On the other hand, the 64-points-based DGM CV-QKD scheme closely approaches the SKR-limit for all channel losses.
AB - To overcome the low reconciliation efficiency problem of Gaussian modulation (GM)-based-continuous variable (CV)-quantum key distribution (QKD), in this paper, we propose to use discretized GM (DGM)-based-CV-QKD. The proposed CV-QKD scheme has complexity and reconciliation efficiency similar to that of discrete modulation (DM)-based-CV-QKD and at the same time solves for the problem of the nonexistence of strict security proofs for the DM-CV-QKD under the collective attacks. We demonstrate that the 32-points-based DGM CV-QKD can closely approach the theoretical SKR-limit in medium and high channel losses regimes. On the other hand, the 64-points-based DGM CV-QKD scheme closely approaches the SKR-limit for all channel losses.
KW - continuous variable (CV)-QKD
KW - discrete modulation
KW - Gaussian modulation
KW - information reconciliation
KW - Quantum communication
KW - quantum key distribution (QKD)
KW - secret-key rate (SKR)
UR - http://www.scopus.com/inward/record.url?scp=85067000091&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85067000091&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2019.2917587
DO - 10.1109/ACCESS.2019.2917587
M3 - Article
VL - 7
SP - 65342
EP - 65346
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
M1 - 8717649
ER -