Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

High-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding

High-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

High-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding

Download PDF
17 pages

Loading next page...
 
/lp/springer_journal/high-capacity-quantum-key-distribution-using-chebyshev-map-values-sHt7VyKkV6

References (31)

Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-016-1420-y
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Quantum Information Processing – Springer Journals

Published: Aug 19, 2016

There are no references for this article.