Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution
classification
🪐 quant-ph
keywords
informationreconciliationblinddistributionprotocolquantumsymmetricverification
read the original abstract
We consider an information reconciliation protocol for quantum key distribution (QKD). In order to correct down the error rate, we suggest a method, which is based on symmetric blind information reconciliation for the low-density parity-check (LDPC) codes. We develop a subsequent verification protocol with the use of $\epsilon$-universal hash functions, which allows verifying the identity between the keys with a certain probability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.