Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

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

Hong Lai, Mehmet Ali Orgun, Josef Pieprzyk, Jing Li, Ming‐Xing Luo, Jinghua Xiao, Fuyuan Xiao

Published Aug 19, 2016• 3 citations
Publisher
DOI
10.1007/s11128-016-1420-y

Related papers

Improved quantum key distribution based on Lucas-valued orbital angular momentum states

Chengji Liu, Changhua Zhu, Min Nie +2 more

We propose an improved quantum key distribution (QKD) protocol based on orbital angular momentum (OAM) entangled states. Three Lucas-valued OAM entangled photons are generated by two cascaded spontaneous parameter down-conversion processes. Two photons are detained and detected by Alice, while the other is transmitted to Bob and then detected. A new scheme is designed to sift the original key bits. Compared to existing protocols, we believe our protocol greatly improves coding efficiency and is verifiable. The analysis results show that our protocol is immune to the photon-number-splitting attack, the intercept-resend attack and the classical information leakage. This work provides an efficient path to high-dimensional QKD systems.

Journal of the Optical Society of America B•Jan 28, 2020•8 citations

Novel encoding–decoding procedure for quantum key distribution

Georgi Bebrov

Quantum Information Processing•Sep 1, 2021•3 citations

Quantum Key Distribution Based on Orthogonal State Encoding

Hao Shu

arXiv:2107.01964•International Journal of Theoretical Physics•Dec 8, 2022•6 citations

Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding*

Hong Lai, Ming-Xing 明星 Luo 罗, Josef Pieprzyk +3 more

Abstract In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value.

Communications in Theoretical Physics•Nov 1, 2016•5 citations

Fast and simple high-capacity quantum cryptography with error detection

Hong Lai, Ming‐Xing Luo, Josef Pieprzyk +4 more

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

Scientific Reports•Apr 13, 2017•8 citations

Quantum key distribution and its applications

Masahiro Takeoka

Elsevier eBooks•Jan 1, 2024•0 citations
We propose an improved quantum key distribution (QKD) protocol based on orbital angular momentum (OAM) entangled states. Three Lucas-valued OAM entangled photons are generated by two cascaded spontaneous parameter down-conversion processes. Two photons are detained and detected by Alice, while the other is transmitted to Bob and then detected. A new scheme is designed to sift the original key bits. Compared to existing protocols, we believe our protocol greatly improves coding efficiency and is verifiable. The analysis results show that our protocol is immune to the photon-number-splitting attack, the intercept-resend attack and the classical information leakage. This work provides an efficient path to high-dimensional QKD systems.
Abstract In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value.
Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.