Toward Efficient Quantum Key Distribution Reconciliation
- 1 Communication System Laboratory Sys’Com, National Engineering School of Tunis, Tunis, Tunisia
- 2 Communication System Laboratory Sys’Com, National Engineering School of Tunis, Tunis, Tunisia
- 3 Communication System Laboratory Sys’Com, National Engineering School of Tunis, Tunis, Tunisia
Abstract
In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low-Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.
- Bennett, C.H. and Brassard, G. (1984) Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, 175.
- Mayers, D. (2001) Unconditional Security in Quantum Cryptography. Journal of the ACM, 48, 351-406. http://dx.doi.org/10.1145/382780.382781
- Shor, P.W. and Preskill, J. (2000) Simple Proof of Security of the BB84 Quantum Key Distribution Protocol. Physical Review Letters, 85, 441-444. http://dx.doi.org/10.1103/PhysRevLett.85.441
- Benletaief, N., Rezig, H. and Bouallegue, A. (2011) Reconciliation for Practical Quantum Key. Mediterranean Microwave Symposium (MMS), Hammamet, 8-10 September 2011, 219-222.
- Kuritsyn, K. (2003) Modification of Error Reconciliation Scheme for Quantum Cryptography. Proceedings of SPIE, 5128, 91-92. http://dx.doi.org/10.1117/12.517879
- Brassard, G. and Salvail, L. (1994) Secret-Key Reconciliation by Public Discussion. Proceedings of Eurocypt’93, 765, 410-423.
- Buttler, W.T., Lamoreaux, S.K. and Torgerson, J.R. (2003) Fast, Efficient Error Reconciliation for Quantum Cryptography. Physical Review Letters, 67, 1-8.
- Van Assche, G., Cardinal, J. and Cerf, N.J. (2004) Reconciliation of a Quantum-Distributed Gaussian Key. IEEE Transactions on Information Theory, 50, 394-400.
- Assche, G.V. (2005) Information-Theoretic Aspects of Quantum Key Distribution. PhD, Université Libre de Bruxelles, Brussels.
- Bloch, M., Thangaraj, A. and McLaughlin, S.W. (2005) Efficient Reconciliation of Correlated Continuous Random Variables Using LDPC Codes. CoRR.
- Leverrier, A., Alleaume, R., Boutros, J., Zemor, G. and Grangier, P. (2008) Multidimensional Reconciliation for Continuous-Variable Quantum Key Distribution. Physical Review A, 77, 42-50. http://dx.doi.org/10.1103/PhysRevA.77.042325
- Elkouss, D., Martinez, J., Lancho, D. and Martin, V. (2010) Rate Compatible Protocol for Information Reconciliation: An Application to QKD. Information Theory Workshop (ITW), Cairo, 6-8 January 2010, 1-5.
- Gallager, R.G. (1962) Low-Density Parity-Check Codes. MIT Press, Cambridge. Preliminary Version in IRE Transactions on Information Theory, 8, 21-28.
- Tanner, R.M. (1981) A Recursive Approach to Low Complexity Codes. IEEE Transactions on Information Theory, 27, 533-547. http://dx.doi.org/10.1109/TIT.1981.1056404