Block-MDS QC-LDPC Codes for Information Reconciliation in Key Distribution
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917601235435520 |
|---|---|
| author | Tauz, Lev Mitra, Debarnab Shreekumar, Jayanth Sarihan, Murat Can Wong, Chee Wei Dolecek, Lara |
| author_facet | Tauz, Lev Mitra, Debarnab Shreekumar, Jayanth Sarihan, Murat Can Wong, Chee Wei Dolecek, Lara |
| contents | Quantum key distribution (QKD) is a popular protocol that provides information theoretically secure keys to multiple parties. Two important post-processing steps of QKD are 1) the information reconciliation (IR) step, where parties reconcile mismatches in generated keys through classical communication, and 2) the privacy amplification (PA) step, where parties distill their common key into a new secure key that the adversary has little to no information about. In general, these two steps have been abstracted as two distinct problems. In this work, we consider a new technique of performing the IR and PA steps jointly through sampling that relaxes the requirement on the IR step, allowing for more success in key creation. We provide a novel LDPC code construction known as Block-MDS QC-LDPC codes that can utilize the relaxed requirement by creating LDPC codes with pre-defined sub-matrices of full-rank. We demonstrate through simulations that our technique of sampling can provide notable gains in successfully creating secret keys. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_00192 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Block-MDS QC-LDPC Codes for Information Reconciliation in Key Distribution Tauz, Lev Mitra, Debarnab Shreekumar, Jayanth Sarihan, Murat Can Wong, Chee Wei Dolecek, Lara Information Theory Quantum key distribution (QKD) is a popular protocol that provides information theoretically secure keys to multiple parties. Two important post-processing steps of QKD are 1) the information reconciliation (IR) step, where parties reconcile mismatches in generated keys through classical communication, and 2) the privacy amplification (PA) step, where parties distill their common key into a new secure key that the adversary has little to no information about. In general, these two steps have been abstracted as two distinct problems. In this work, we consider a new technique of performing the IR and PA steps jointly through sampling that relaxes the requirement on the IR step, allowing for more success in key creation. We provide a novel LDPC code construction known as Block-MDS QC-LDPC codes that can utilize the relaxed requirement by creating LDPC codes with pre-defined sub-matrices of full-rank. We demonstrate through simulations that our technique of sampling can provide notable gains in successfully creating secret keys. |
| title | Block-MDS QC-LDPC Codes for Information Reconciliation in Key Distribution |
| topic | Information Theory |
| url | https://arxiv.org/abs/2403.00192 |