Novel Reconciliation Protocol Based on Spinal Code for Continuous-variable Quantum Key Distribution
Reconciliation is a crucial procedure in post-processing of continuous variable quantum key distribution (CV-QKD) system, which is used to make two distant legitimate parties share identical corrected keys. The adaptive reconciliation is necessary and important for practical systems to cope with the...
Saved in:
Main Authors | , , , , |
---|---|
Format | Journal Article |
Language | English |
Published |
27.09.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Reconciliation is a crucial procedure in post-processing of continuous
variable quantum key distribution (CV-QKD) system, which is used to make two
distant legitimate parties share identical corrected keys. The adaptive
reconciliation is necessary and important for practical systems to cope with
the variable channel. Many researchers adopt the punctured LDPC codes to
implement adaptive reconciliation. In this paper, a novel rateless
reconciliation protocol based on spinal code is proposed, which can achieve a
high-efficiency and adaptive reconciliation in a larger range of SNRs. Due to
the short codes length and simple tructure, our protocol is easy to implement
without the complex codes designs of fixed rate codes, e.g., LDPC codes.
Meanwhile, the structure of our protocol is highly parallel, which is suitable
for hardware implementation, thus it also has the potential of high-speed
hardware implementation. Besides, the security of proposed protocol is proved
in theory. Experiment results show that the reconciliation efficiency maintains
around 95% for ranging SNRs in a larger range (0,0.5), even exceeds 96.5% at
extremely low SNR (<= 0.03) by using this novel scheme. The proposed protocol
makes the long-distance CV-QKD systems much easier and stable to perform a
high-performance and adaptive reconciliation. |
---|---|
AbstractList | Reconciliation is a crucial procedure in post-processing of continuous
variable quantum key distribution (CV-QKD) system, which is used to make two
distant legitimate parties share identical corrected keys. The adaptive
reconciliation is necessary and important for practical systems to cope with
the variable channel. Many researchers adopt the punctured LDPC codes to
implement adaptive reconciliation. In this paper, a novel rateless
reconciliation protocol based on spinal code is proposed, which can achieve a
high-efficiency and adaptive reconciliation in a larger range of SNRs. Due to
the short codes length and simple tructure, our protocol is easy to implement
without the complex codes designs of fixed rate codes, e.g., LDPC codes.
Meanwhile, the structure of our protocol is highly parallel, which is suitable
for hardware implementation, thus it also has the potential of high-speed
hardware implementation. Besides, the security of proposed protocol is proved
in theory. Experiment results show that the reconciliation efficiency maintains
around 95% for ranging SNRs in a larger range (0,0.5), even exceeds 96.5% at
extremely low SNR (<= 0.03) by using this novel scheme. The proposed protocol
makes the long-distance CV-QKD systems much easier and stable to perform a
high-performance and adaptive reconciliation. |
Author | Mao, Haokun Wen, Xuan Luo, Yi Yan, Bingze Li, Qiong |
Author_xml | – sequence: 1 givenname: Xuan surname: Wen fullname: Wen, Xuan – sequence: 2 givenname: Qiong surname: Li fullname: Li, Qiong – sequence: 3 givenname: Haokun surname: Mao fullname: Mao, Haokun – sequence: 4 givenname: Yi surname: Luo fullname: Luo, Yi – sequence: 5 givenname: Bingze surname: Yan fullname: Yan, Bingze |
BackLink | https://doi.org/10.48550/arXiv.1909.12496$$DView paper in arXiv |
BookMark | eNotj8lOwzAURb2ABRQ-gBX-gQSniR17CWEUFWP30bP9LFly7coZRP-etrC6R3dxpHNOTmKKSMhVxcpGcs5uIP_4uawUU2W1bJQ4I-YtzRjoF5oUjQ8eRp8i_chpTCYFegcDWrp_vrc-QqBdskhdynuIo49TmoZihuxBB6SfE8Rx2tBX3NF7P4zZ6-mguyCnDsKAl_-7IOvHh3X3XKzen16621UBohWFsS2T0hhkumZCtUa6RigJnDveVsgatLJSrUXnpG6cVlpyIUxja7YElLpekOs_7bGy32a_gbzrD7X9sbb-BTldU04 |
ContentType | Journal Article |
Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
DBID | AKY GOX |
DOI | 10.48550/arxiv.1909.12496 |
DatabaseName | arXiv Computer Science arXiv.org |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
ExternalDocumentID | 1909_12496 |
GroupedDBID | AKY GOX |
ID | FETCH-LOGICAL-a676-cd7088cce0b30697c8f4698a55f571e04ed8197deff8b4fb9b8566c4d302ae8b3 |
IEDL.DBID | GOX |
IngestDate | Mon Jan 08 05:50:24 EST 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a676-cd7088cce0b30697c8f4698a55f571e04ed8197deff8b4fb9b8566c4d302ae8b3 |
OpenAccessLink | https://arxiv.org/abs/1909.12496 |
ParticipantIDs | arxiv_primary_1909_12496 |
PublicationCentury | 2000 |
PublicationDate | 2019-09-27 |
PublicationDateYYYYMMDD | 2019-09-27 |
PublicationDate_xml | – month: 09 year: 2019 text: 2019-09-27 day: 27 |
PublicationDecade | 2010 |
PublicationYear | 2019 |
Score | 1.7451813 |
SecondaryResourceType | preprint |
Snippet | Reconciliation is a crucial procedure in post-processing of continuous
variable quantum key distribution (CV-QKD) system, which is used to make two
distant... |
SourceID | arxiv |
SourceType | Open Access Repository |
SubjectTerms | Computer Science - Cryptography and Security Physics - Quantum Physics |
Title | Novel Reconciliation Protocol Based on Spinal Code for Continuous-variable Quantum Key Distribution |
URI | https://arxiv.org/abs/1909.12496 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV09T8MwFLTaTiwIBKh8ygNrwE1iOx6hUCoQBUSRulX-eJYqlaQKTQX_nuckCBZW29M9WXdP9rsj5JwnFrjR2OQkIo1SayFSzMSRt8oB8yxz9dT740SM39L7GZ91CP2ZhdHl52LT-AObj0tkK3UR4pFFl3TjOHzZunuaNY-TtRVXe_73HGrMeukPSYx2yHar7uhVU45d0oF8j9hJsYElDY1ebhfLBgv6XBbrAqtAr5FHHMWV11VIqKLDwgFFKUmDcdQir7A1jzbY0YYZJ_pSIRLVO32AL3oTPG_buKp9Mh3dTofjqM02iLSQIrJO4vVGZJhBza6kzXyIctScey4HwFJwSNXSgfeZSb1RJkPdZVOXsFhDZpID0suLHPqEmgHPpBuA4NqlVoNRLraaK-ZFLI1ih6RfIzJfNfYV8wDWvAbr6P-tY7KF0qD-TRXLE9JblxWcIv2uzVldg2-zoIgI |
link.rule.ids | 228,230,783,888 |
linkProvider | Cornell University |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Novel+Reconciliation+Protocol+Based+on+Spinal+Code+for+Continuous-variable+Quantum+Key+Distribution&rft.au=Wen%2C+Xuan&rft.au=Li%2C+Qiong&rft.au=Mao%2C+Haokun&rft.au=Luo%2C+Yi&rft.date=2019-09-27&rft_id=info:doi/10.48550%2Farxiv.1909.12496&rft.externalDocID=1909_12496 |