{"id":17023,"date":"2017-02-28T21:51:21","date_gmt":"2017-02-28T19:51:21","guid":{"rendered":"http:\/\/hgpu.org\/?p=17023"},"modified":"2017-02-28T21:51:21","modified_gmt":"2017-02-28T19:51:21","slug":"key-reconciliation-with-low-density-parity-check-codes-for-long-distance-quantum-cryptography","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=17023","title":{"rendered":"Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography"},"content":{"rendered":"<p>The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density parity-check (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to extend the maximum reconciliation distance between the two remote parties. Key reconciliation over multiple dimensions has been shown to further improve the error-correction performance of multi-edge LDPC codes in CV-QKD, thereby increasing both the secret key rate and distance. However, the computational complexity of LDPC decoding for long block lengths on the order of 10^6 bits remains a challenge. This work introduces a quasi-cyclic code construction for multi-edge LDPC codes that is highly suitable for hardware-accelerated decoding on a modern graphics processing unit (GPU). When combined with an 8-dimensional reconciliation scheme, the LDPC decoder achieves a raw decoding throughput of 1.72Mbit\/s and an information throughput of 7.16Kbit\/s using an NVIDIA GeForce GTX 1080 GPU, at a maximum distance of 164km with an effective secret key rate of 8.24&#215;10^{-7} bits\/pulse for a rate 0.02 multi-edge code with block length of 10^6 bits. For distances beyond 130km, the decoder delivers an information throughput between 2745x and 9138x higher than the maximum secret key rate achievable with a 1MHz light source, thereby showing that LDPC decoding is no longer the computational bottleneck in long-distance CV-QKD.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density parity-check (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[89,3,12,287],"tags":[14,20,1898,797,1783,930,1800],"class_list":["post-17023","post","type-post","status-publish","format-standard","hentry","category-nvidia-cuda","category-paper","category-physics","category-security","tag-cuda","tag-nvidia","tag-nvidia-geforce-gtx-1080","tag-parity-check-codes","tag-physics","tag-quantum-physics","tag-security"],"views":2820,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/17023","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=17023"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/17023\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=17023"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=17023"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=17023"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}