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

arXiv:0910.2578

Quantum Key Distribution Highly Sensitive to Eavesdropping

STEPHEN D. BRIERLEY

Published Oct 14, 2009• 15 citations
arXivHTMLPDF

Abstract

We introduce a new quantum key distribution protocol that uses d-level quantum systems to encode an alphabet with c letters. It has the property that the error rate introduced by an intercept-and-resend attack tends to one as the numbers c and d increase. In dimension d=2, when the legitimate parties use a complete set of three mutually unbiased bases, the protocol achieves a quantum bit error rate of 57.1%. This represents a significant improvement over the 25% quantum bit error rate achieved in the BB84 protocol or 33% in the six-state protocol.

DOI
10.48550/arxiv.0910.2578

Related papers

High error-rate quantum key distribution for long-distance communication

Muhammad Mubashir Khan, Michael Murphy, Almut Beige

In the original BB84 protocol by Bennett and Brassard, an eavesdropper is detected because his attempts to intercept information result in a quantum bit error rate (QBER) of at least 25%. Here we design an alternative quantum key distribution protocol, where Alice and Bob use two mutually unbiased bases with one of them encoding a '0' and the other one encoding a '1'. The security of the scheme is due to a minimum index transmission error rate (ITER) introduced by an eavesdropper that increases significantly for higher-dimensional photon states. This allows for more noise in the transmission line, thereby increasing the possible distance between Alice and Bob without the need for intermediate nodes.

arXiv:0901.3909•New Journal of Physics•Jun 22, 2009•57 citations

Improved Eavesdropping Detection in Quantum Key Distribution

Muhammad Mubashir Khan, Jie Xu, Almut Beige

Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum bit error rate introduced by an eavesdropper unavoidably exceeds the system error rate. This condition guarantees that an eavesdropper cannot disguise his presence by simply replacing the original transmission line with a less faulty one. Unfortunately, this condition also limits the possible distance between the communicating parties, Alice and Bob, to a few hundred kilometers. To overcome this problem, we design a QKD protocol which allows Alice and Bob to distinguish system errors from eavesdropping errors. If they are able to identify the origin of their errors, they can detect eavesdropping even when the system error rate exceeds the eavesdropping error rate. To achieve this, the proposed protocol employs an alternative encoding of information in two-dimensional photon states. Errors manifest themselves as quantum bit and as index transmission errors with a distinct correlation between them in case of intercept-resend eavesdropping. As a result, Alice and Bob can tolerate lower eavesdropping and higher system error rates without compromising their privacy.

arXiv:1112.1110•Dec 5, 2011•1 citation

Noise-resistant quantum key distribution protocol

B. A. Grishanin, Сыч Денис Васильевич, Victor N. Zadkov

We present the scheme of compatible quantum information analysis of the quantum key distribution (QKD) protocols, which give answers to the following questions: is it possible to improve the quantum bit error rate (QBER) of the 6-state protocol by employing more states, up to infinity, and can we essentially improve the QBER if the multidimensional Hilbert space with dimensionality more than 3 is used? Also, a novel quantum key distribution (QKD) protocol, based on all unselected states of a quantum system, which set the alphabet with continuous set of letters, is proposed. Employing all states of the Hilbert space leads to the maximal quantum uncertainty of transmitted states and therefore an eavesdropper receives the minimal amount of information. For the case of two-dimensional Hilbert space, our protocol allows secure transmission at the error rate higher than that one for the BB84-protocol and comparable with the characteristics of the best known QKD-protocols. However, with increasing the dimensionality of the Hilbert space the critical error rate for our protocol increases and in the limit of infinite-dimensional space the protocol becomes non-threshold.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2004•0 citations

Quantum cryptography using larger alphabets

Helle Bechmann-Pasquinucci, Wolfgang Tittel

Like all of quantum information theory, quantum cryptography is traditionally based on two-level quantum systems. In this paper, a protocol for quantum key distribution based on higher-dimensional systems is presented. An experimental realization using an interferometric setup is also proposed. Analyzing this protocol from the practical side, one finds an increased key creation rate while keeping the initial laser pulse rate constant. Analyzing it for the case of intercept/resend eavesdropping strategy, an increased error rate is found compared to two-dimensional systems, hence an advantage for the legitimate users to detect an eavesdropper.

arXiv:quant-ph/9910095•Physical Review A•May 16, 2000•477 citations

Quantum key distribution using multilevel encoding

Mohamed Bourennane, Anders Karlsson, Gunnar G. Bjork

In this article, protocols for quantum key distribution based on encoding in higher dimensional systems in N-dimensional Hilbert space are proposed. We extend the original Bennett-Brassard protocol using two complementary bases and two-dimensional states to M mutually complementary bases and N orthogonal vectors in each base. We study the mutual information between the legitimate parties and the eavesdropper and the error rate by considering various incoherent eavesdropping attacks as a function of the dimension of the Hilbert space.

Physical Review A•Jun 6, 2001•285 citations

Quantum Key Distribution Using BB84 Protocol: A Computational Study of Error Rates

Anita Pokharel, Rupisha Dangol, Hari Neupane

Quantum key distribution (QKD) enables secure communication using the principles of quantum physics. The BB84 protocol is not only effective for secure key sharing but also for detecting eavesdropping. This study simulates a computational model of QKD and analyzes error rates under varying numbers of bits. Using Python-based simulations with n = 10, n = 100, and n = 1000 bits, and a fixed noise probability of 0.02, we evaluated scenarios both with and without eavesdropping over 1000 trials. The results show an average error rate of 2% without eavesdropping and over 26% with eavesdropping. Standard deviation increases with lower n, indicating higher variability. This study validates BB84’s robustness under noise and demonstrates its sensitivity to third-party interference.

Journal of Nepal Physical Society•Dec 18, 2025•0 citations
We introduce a new quantum key distribution protocol that uses d-level quantum systems to encode an alphabet with c letters. It has the property that the error rate introduced by an intercept-and-resend attack tends to one as the numbers c and d increase. In dimension d=2, when the legitimate parties use a complete set of three mutually unbiased bases, the protocol achieves a quantum bit error rate of 57.1%. This represents a significant improvement over the 25% quantum bit error rate achieved in the BB84 protocol or 33% in the six-state protocol.
In the original BB84 protocol by Bennett and Brassard, an eavesdropper is detected because his attempts to intercept information result in a quantum bit error rate (QBER) of at least 25%. Here we design an alternative quantum key distribution protocol, where Alice and Bob use two mutually unbiased bases with one of them encoding a '0' and the other one encoding a '1'. The security of the scheme is due to a minimum index transmission error rate (ITER) introduced by an eavesdropper that increases significantly for higher-dimensional photon states. This allows for more noise in the transmission line, thereby increasing the possible distance between Alice and Bob without the need for intermediate nodes.
Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum bit error rate introduced by an eavesdropper unavoidably exceeds the system error rate. This condition guarantees that an eavesdropper cannot disguise his presence by simply replacing the original transmission line with a less faulty one. Unfortunately, this condition also limits the possible distance between the communicating parties, Alice and Bob, to a few hundred kilometers. To overcome this problem, we design a QKD protocol which allows Alice and Bob to distinguish system errors from eavesdropping errors. If they are able to identify the origin of their errors, they can detect eavesdropping even when the system error rate exceeds the eavesdropping error rate. To achieve this, the proposed protocol employs an alternative encoding of information in two-dimensional photon states. Errors manifest themselves as quantum bit and as index transmission errors with a distinct correlation between them in case of intercept-resend eavesdropping. As a result, Alice and Bob can tolerate lower eavesdropping and higher system error rates without compromising their privacy.
We present the scheme of compatible quantum information analysis of the quantum key distribution (QKD) protocols, which give answers to the following questions: is it possible to improve the quantum bit error rate (QBER) of the 6-state protocol by employing more states, up to infinity, and can we essentially improve the QBER if the multidimensional Hilbert space with dimensionality more than 3 is used? Also, a novel quantum key distribution (QKD) protocol, based on all unselected states of a quantum system, which set the alphabet with continuous set of letters, is proposed. Employing all states of the Hilbert space leads to the maximal quantum uncertainty of transmitted states and therefore an eavesdropper receives the minimal amount of information. For the case of two-dimensional Hilbert space, our protocol allows secure transmission at the error rate higher than that one for the BB84-protocol and comparable with the characteristics of the best known QKD-protocols. However, with increasing the dimensionality of the Hilbert space the critical error rate for our protocol increases and in the limit of infinite-dimensional space the protocol becomes non-threshold.
Like all of quantum information theory, quantum cryptography is traditionally based on two-level quantum systems. In this paper, a protocol for quantum key distribution based on higher-dimensional systems is presented. An experimental realization using an interferometric setup is also proposed. Analyzing this protocol from the practical side, one finds an increased key creation rate while keeping the initial laser pulse rate constant. Analyzing it for the case of intercept/resend eavesdropping strategy, an increased error rate is found compared to two-dimensional systems, hence an advantage for the legitimate users to detect an eavesdropper.
In this article, protocols for quantum key distribution based on encoding in higher dimensional systems in N-dimensional Hilbert space are proposed. We extend the original Bennett-Brassard protocol using two complementary bases and two-dimensional states to M mutually complementary bases and N orthogonal vectors in each base. We study the mutual information between the legitimate parties and the eavesdropper and the error rate by considering various incoherent eavesdropping attacks as a function of the dimension of the Hilbert space.
Quantum key distribution (QKD) enables secure communication using the principles of quantum physics. The BB84 protocol is not only effective for secure key sharing but also for detecting eavesdropping. This study simulates a computational model of QKD and analyzes error rates under varying numbers of bits. Using Python-based simulations with n = 10, n = 100, and n = 1000 bits, and a fixed noise probability of 0.02, we evaluated scenarios both with and without eavesdropping over 1000 trials. The results show an average error rate of 2% without eavesdropping and over 26% with eavesdropping. Standard deviation increases with lower n, indicating higher variability. This study validates BB84’s robustness under noise and demonstrates its sensitivity to third-party interference.