High-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding
- 188 Downloads
We propose an approach that achieves high-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding. In particular, we encode a key with the Chebyshev-map values corresponding to Lucas numbers and then use k-Chebyshev maps to achieve consecutive and flexible key expansion and apply the pre-shared classical information between Alice and Bob and fountain codes for privacy amplification to solve the security of the exchange of classical information via the classical channel. Consequently, our high-capacity protocol does not have the limitations imposed by orbital angular momentum and down-conversion bandwidths, and it meets the requirements for longer distances and lower error rates simultaneously.
KeywordsHigh-capacity quantum key distribution k-Chebyshev maps Consecutive and flexible key expansion Longer distances and lower error rates
Hong Lai has been supported by the Fundamental Research Funds for the Central Universities (No. XDJK2016C043) and the Doctoral Program of Higher Education (No. SWU115091). Josef Pieprzyk has been supported by National Science Centre, Poland, Project Registration Number UMO-2014/15/B/ST6/05130. Fuyuan Xiao is supported by the Fundamental Research Funds for the Central Universities (No. XDJK2015C107) and the Doctoral Program of Higher Education (No. SWU115008). Jinghua Xiao is supported by the National Natural Science Foundation of China (No. 61377067). Mingxing Luo is supported by the National Natural Science Foundation of China (No. 61303039). The paper is also supported by the financial support in part by the 1000-Plan of Chongqing by Southwest University (No. SWU116007).
- 24.Buschman, R.G.: http://www.fq.math.ca/Scanned/1-4/buschman-a. Last accessed 27 Nov 2014
- 27.Weisstein, E.W.: Lucas number. http://mathworld.wolfram.com/LucasNumber.html. Last accessed 27 Nov 2014
- 28.Tseng, H., Jan, R., Yang, W.: A chaotic maps-based key agreement protocol that preserves user anonymity. In: IEEE International Conference on Communications, ICC2009, Dresden, Germany, pp. 1–6 (2009)Google Scholar
- 29.Kohda, T., Tsuneda, A.: Pseudonoise sequences by chaotic nonlinear maps and their correlation properties. IEICE Trans. Commun. E76-B, 855–862 (1993)Google Scholar
- 30.Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: Steenstrup, M. (ed.) Proceedings of the ACM SIGCOMM ’98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM ’98), pp. 56–67. ACM, New YorkGoogle Scholar
- 31.Lai, H., Orgun, M.A., Pieprzyk, J., Xiao, J.H., Xue, L,Y., Jia, Z.T.: Controllable quantum private queries using an entangled Fibonacci-sequence spiral source. Phys. Lett. A 379, 2561–2568 (2015)Google Scholar
- 33.Guha, S., Hayden, P., Krovi, H., Lloyd, S., Lupo, C., Shapiro, J.H.: Quantum enigma machines and the locking capacity of a quantum channel. Phys. Rev. X 4, 011016 (2014)Google Scholar