Modified error correction method using one-time pad in qkd systems
DOI:
https://doi.org/10.18372/2310-5461.46.14803Keywords:
QKD, LDPC, error correction, parity-check matrix, post-processingAbstract
This paper analyzes and adapts the known method of error correction of CV-QKD systems, proposed by Mario Milicevic, which modulates a code word with a correlated Gaussian sequence in amplitude and phase quadratures of coherent states, for use in DV-QKD systems, in which information is encoded by single-photon polarization states, by using a sieved key in the form of classical bits, from which the codeword is created, and also a one-time pad (Vernam cipher), which uses a fairly easy to implement classic Boolean “exclusive OR” operation (XOR). The main task of error correction is to correct errors in order to share the same secure key between the two parties (usually called Alice and Bob). Various factors can cause errors. The unreliability of the quantum channel is due to the fact that photons can cause noise when changing the polarization vector of the photon. In the proposed solution, the quantum component of the protocol occurs only in the first stage of transmission of the protected key, where the exchange of photons. The quantum key distribution system has inevitable errors in the sieved key, which must be corrected by the error correction algorithm to create a secure key. Unlike other known QKD systems, where at the stage of error correction the sifted keys are corrected and passed to the next stage of increasing confidentiality, in the modified method it is proposed to use sifted keys as keys in disposable Vernam ciphers, and the vector that will go to the next stage way and combine with the sifted key. The difference in the sieved keys between the two parties is corrected by means of low-density parity check matrices (LDPC), which are known to both of them in advance. Parity check matrices are created by an algorithm proposed by David MacKay and Radford Neal. Radford Neal open-source program code, is used to create final work program to checking proposed algorithm.
References
Ekert A. K., “Quantum Cryptography and Bell’s Theorem,” P.P. 413–418, 1992, DOI: 10.1007/978-1-4615-3386-3_34.
Rivest R. L., Shamir A., and Adleman L., “A method for obtaining digital signatures and public-key cryptosystems” Commun. ACM, vol. 21, № 2. Pр. 120–126, Feb. 1978, DOI: 10.1145/359340.359342.
Bennett C. H. and Brassard G., “BB84 highest.pdf,” Proceedings of IEEE International Conference on Computers, Systems and Signal Processing. Pр. 174–179, 1984.
Sibson P. et al., “Chip-based quantum key distribution,” Nat. Commun., vol. 8, May 2016, 2017, DOI: 10.1038/ncomms13984.
Lucamarini M., Yuan Z. L., Dynes J. F., and Shields A. J., “Overcoming the rate–distance limit of quantum key distribution without quantum repeaters,” Nature, vol. 557, № 7705. Pр. 400–403, May 2018, DOI: 10.1038/s41586-018-0066-6.
Yuan Z. et al., “10-Mb/s Quantum Key Distribution,” J. Light. Technol., vol. 36, № 16. Pр. 3427–3433, 2018, DOI: 10.1109/JLT.2018.2843136.
Lo H.-K., Curty M., and Qi B., “Measurement-Device-Independent Quantum Key Distribution,” Phys. Rev. Lett., vol. 108, №.13, P. 130503, Mar. 2012.
DOI: 10.1103/PhysRevLett.108.130503.
Park C. H. et al., “Practical plug-and-play measurement-device-independent quantum key distribution with polarization division multiplexing,” IEEE Access, vol. 6. Pр. 58587–58593, 2018, DOI: 10.1109/ACCESS.2018.2874028.
Park B. K.,. Woo M. K, Kim Y.-S., Cho Y.-W., Moon S., and Han S.-W., “User-independent optical path length compensation scheme with sub-nanosecond timing resolution for a 1 × N quantum key distribution network system,” Photonics Res., vol. 8, № 3. P. 296, Mar. 2020, DOI: 10.1364/PRJ.377101.
Eriksson T. A et al., “Crosstalk Impact on Continuous Variable Quantum Key Distribution in Multicore Fiber Transmission,” IEEE Photonics Technol. Lett., vol. 31, № 6. Pр. 467–470, 2019, DOI: 10.1109/LPT.2019.2898458.
Brassard G. and Salvail L., “Secret-key reconciliation by public discussion,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 765 LNCS. Pр. 410–423, 1994, DOI: 10.1007/3-540-48285-7_35.
Buttler W. T., Lamoreaux S. K., Torger¬son J. R., Nickel G. H., Donahue C. H., and Peter¬son C. G., “Fast, efficient error reconciliation for quantum cryptography,” Phys. Rev. A - At. Mol. Opt. Phys., vol. 67, № 5. P. 8, 2003,
DOI: 10.1103/PhysRevA.67.052303.
Gallager, “Low density parity check codes,” 1963.
Mackay D. J. C. and Neal R. M., “Good codes based on very sparse matrices,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1995, vol. 1025. Pр. 100–111, DOI: 10.1007/3-540-60693-9_13.
MacKay D. J. C., “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inf. Theory, vol. 45, № 2. Pр. 399–431, 1999,
DOI: 10.1109/18.748992.
Milicevic M., Feng C., Zhang L. M., and.
Gulak P. G, “Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography,” № April. Pр. 1–23, 2017.
DOI: 10.1038/s41534-018-0070-6.
S. Vernam, “Secret signaling system,” 1919.
Shannon C. E., “Communication Theory of Secrecy Systems,” Bell Syst. Tech. J., vol. 28, № 4. Pр. 656–715, 1949, DOI: 10.1002/j.1538-7305.1949.tb00928.x.
Peng W., Cheng D., and Song C., “One-time-pad cryptography scheme based on a three-dimensional DNA self-assembly pyramid structure,” PLoS One, vol. 13. № 11. P. e0206612, Nov. 2018.
DOI: 10.1371/journal.pone.0206612
