[1] C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental quantum cryptography,” Journal of Cryptology, vol. 5, pp. 3–28, 1992.
[2] C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” Theor. Comput. Sci., vol. 560, pp. 7–11, 2014.
[3] A. K. Ekert, “Quantum cryptography based on Bell’s theorem,” Phys. Rev. Lett., vol. 67, pp. 661–663, 1991.
[5] V. Zapatero, W. Wang, and M. Curty, “A fully passive transmitter for decoy-state quantum key distribution,” Quantum Sci. Technol., vol. 8, p. 025014, 2023.
[6] S. Dong et al., “Decoy state semi-quantum key distribution,” EPJ Quant. Technol., vol. 10, 2023.
[7] A. M. Toonabi, M. D. Darareh, and S. Janbaz, “A two-dimensional quantum key distribution protocol based on polarization-phase encoding,” Int. J. Quantum Inf., vol. 17, p. 1950058, 2019.
[8] A. M. Toonabi, M. D. Darareh, and S. Janbaz, “High-dimensional quantum key distribution using polarization-phase encoding: security analysis,” Int. J. Quantum Inf., vol. 18, p. 2050031, 2020.
[9] G. S. Vernam, “Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications,” Transactions of the American Institute of Electrical Engineers, vol. XLV, pp. 295–301, 1926.
[10] S. J. Jonson, “Low-density parity-check codes,” Iterative Error Correction, pp. 34–74, 2009.
[11] X. –Y. Hu, E. Eleftheriou, D.-M. Arnold, and A. Dholakia, “Efficient implementations of the sum-product algorithm for decoding LDPC codes,” GLOBECOM’01. IEEE Global Telecommunications Conference, 2001.
[12] E. Kiktenko, A. Trushechkin, Y. Kurochkin, and A. Fedorov, “Post-processing procedure for industrial quantum key distribution systems,” Journal of Physics: Conference Series, vol. 741, p. 012081, 2016.
[13] Q. Li, D. Le, X. Wu, X. Niu, and H. Guo, “Efficient bit sifting scheme of post-processing in quantum key distribution,” Quantum Information Processing, vol. 14, pp. 3785–3811, 2015.
[14] E. Diamanti, “Security and implementation of differential phase shift quantum key distribution systems,” Doctoral Dissertation, Stanford University, 2006.
[16] T. Krovetz and P. Rogaway, “Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction,” Information Security and Cryptology — ICISC 2000, pp. 73–89, 2001.
[17] H. Krawczyk, “New Hash Functions for Message Authentication,” Lecture Notes in Computer Science, pp. 301–310, 1995.