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

Journal of Experimental and Theoretical Physics

Quantum Key Distribution As a Scheme with Bernoulli Tests

S. N. Molotkov

Published Jun 1, 2018• 9 citations
Publisher

Abstract

A family of attacks on the BB84 protocol of quantum key distribution is explicitly constructed under which the lower bound of fundamental entropy uncertainty relations is attained in the asymptotic limit of long sequences. All attacks are parameterized by a single parameter Q, which has the meaning of error probability on the receiver side, is known to the eavesdropper, but is reliably unknown to legitimate users. The situation on the receiver side looks like a scheme with classical Bernoulli tests with unknown parameter Q. For the eavesdropper, the situation also looks like a Bernoulli scheme—tossing a coin with quantum states, where each message of the eavesdropper leads to a quantum state that is uniquely determined by the outcome of measurements on the receiver side. A statistical interpretation is given to the estimate of the error probability for Q and the key secrecy parameter εδ,n. It is shown that, for a given length n of a series of tests, the width δ of the confidence interval actually determines the accuracy of the estimate for the parameter Q and, accordingly, the key secrecy level—the value of the secrecy parameter $${\varepsilon _{\delta ,n}} = 2{e^{ - 2{\delta ^2}n}}$$ .

DOI
10.1134/s1063776118060110

Related papers

Quantum key distribution in a single-photon regime with nonorthogonal basis states

Dmitry Anatolevich Kronberg, S. N. Molotkov

A quantum key distribution protocol with nonorthogonal basis states is a generalization of the known BB84 key distribution protocol. The critical error and length of a secure key have been determined for the protocol with nonorthogonal basis states for an arbitrary angle between information states. An explicit optimal attack on the distributed key has been constructed; this attack maximizes eavesdropper information at a given error on the receiver side.

Journal of Experimental and Theoretical Physics Letters•Jun 1, 2009•1 citation

Quantum Bit Error Rate Analysis in BB84 Quantum Key Distribution: Measurement, Statistical Estimation, and Eavesdropping Detection

Jaydeep Rath, Prajwal Panth, P. S. N. Bhaskar

Quantum Key Distribution (QKD) provides information-theoretic security by exploiting the principles of quantum mechanics. Among QKD protocols, the BB84 scheme remains the most widely adopted for both theoretical research and practical implementation. A critical parameter determining the reliability and security of BB84 is the Quantum Bit Error Rate (QBER), which quantifies errors in the sifted key arising from channel noise or potential eavesdropping. This paper presents a systematic review and analysis of QBER within the BB84 protocol, examining its calculation, statistical estimation methods, and role in detecting eavesdropping activity. Simulation results, corroborated by reported experimental observations, reveal a near-linear relationship between eavesdropping intensity and QBER, with values approaching 25% under full intercept-resend attacks. Four confidence interval estimation methods, Wald, Wilson, Clopper-Pearson, and Hoeffding's inequality, are compared for robust QBER analysis in finite-key scenarios. Protocol enhancements, including decoy-state methods, hybrid cryptographic models, and quantum-resistant authentication, are discussed as mechanisms to mitigate errors and strengthen resilience across fiber, free-space, underwater, and satellite QKD systems. Open challenges in distinguishing noise-induced errors from malicious eavesdropping, and the role of adaptive error correction and machine-learning-assisted QBER estimation in future quantum networks, are identified as key directions for further research.

quant-pharXiv:2603.27278•Mar 31, 2026•1 citation

Authentication Through Error Estimation in QKD

Ludovic Noirie, Rémi Varloot

The one-time pad is an encryption technique that is proven to be unbreakable by an eavesdropper. It relies on a single-use secret key shared between a sender and a receiver, whose length is that of the message to be encrypted. The creation of such a key can be achieved through Quantum Key Distribution (QKD), a method based on quantum physics that ensures eavesdroppers' actions can be statistically detected with arbitrarily high probability. It requires a quantum channel for qubit transmission and a classical channel for classical bit transmission. However, the classical channel is generally authenticated by classical means using cryptographic hash functions that are not provably secure. In this paper, we propose for the first time a QKD protocol, based on BB84, that uses quantum error estimation to authenticate both channels. This method relies on the consumption of a smaller pre-shared key, and is provably secure thanks to fundamental results in both information theory and quantum physics.

Globecom•Dec 4, 2023•3 citations

Explicit attack on the key in quantum cryptography (BB84 protocol) reaching the theoretical error limit Q c ≈ 11%

S. N. Molotkov, A. V. Timofeev

An explicit attack on the distributed key is presented for the BB84 quantum cryptography protocol. In this attack, the theoretical maximum of the eavesdropper’s (Eve’s) information on the key is reached at the minimum possible error Q at the receiver end. Eve’s maximum information is reached in collective measurements, which are constructed in the explicit form and are performed by Eve at the very end of the protocol. The situation in the critical error range 11% < Q c < 15% is determined.

Journal of Experimental and Theoretical Physics Letters•Jul 1, 2007•10 citations

On the quantum-mechanical bound on the loss of information through side channels in quantum cryptography

S. N. Molotkov

The security of cryptographic keys in quantum cryptography systems is guaranteed by fundamental quantum mechanical exclusion principles. A quantum channel through which quantum states are transferred is not controlled and an eavesdropper can perform any modifications with it. The security of quantum key distribution protocols has already been proved [M. Tomamichel et al., Nature Commun. 3 , 634 (2011); S. N. Molotkov, J. Exp. Theor. Phys. 115 , 969 (2012)], including the realistic case of a finite length of transmitted sequences. It is always assumed that the eavesdropper has neither direct nor indirect access to the transmitting and receiving equipment. The real situation is somewhat different. The preparation and detection of quantum states occur according to random sequences that are generated on the transmitter and receiver sides. Detecting electromagnetic radiation generated in these processes, the eavesdropper can obtain additional information on a key. The upper quantum-mechanical bound on the amount of information of the eavesdropper on the key that can be obtained through a side channel has been determined.

Journal of Experimental and Theoretical Physics Letters•Jul 1, 2013•0 citations

Security of quantum key distribution

Shuang Wang, Jingzheng Huang, Zheng‐Fu Han +10 more

We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Oct 1, 2012•43 citations
A family of attacks on the BB84 protocol of quantum key distribution is explicitly constructed under which the lower bound of fundamental entropy uncertainty relations is attained in the asymptotic limit of long sequences. All attacks are parameterized by a single parameter Q, which has the meaning of error probability on the receiver side, is known to the eavesdropper, but is reliably unknown to legitimate users. The situation on the receiver side looks like a scheme with classical Bernoulli tests with unknown parameter Q. For the eavesdropper, the situation also looks like a Bernoulli scheme—tossing a coin with quantum states, where each message of the eavesdropper leads to a quantum state that is uniquely determined by the outcome of measurements on the receiver side. A statistical interpretation is given to the estimate of the error probability for Q and the key secrecy parameter εδ,n. It is shown that, for a given length n of a series of tests, the width δ of the confidence interval actually determines the accuracy of the estimate for the parameter Q and, accordingly, the key secrecy level—the value of the secrecy parameter εδ,n=2e−2δ2n{\varepsilon _{\delta ,n}} = 2{e^{ - 2{\delta ^2}n}}εδ,n​=2e−2δ2n .
Quantum Key Distribution (QKD) provides information-theoretic security by exploiting the principles of quantum mechanics. Among QKD protocols, the BB84 scheme remains the most widely adopted for both theoretical research and practical implementation. A critical parameter determining the reliability and security of BB84 is the Quantum Bit Error Rate (QBER), which quantifies errors in the sifted key arising from channel noise or potential eavesdropping. This paper presents a systematic review and analysis of QBER within the BB84 protocol, examining its calculation, statistical estimation methods, and role in detecting eavesdropping activity. Simulation results, corroborated by reported experimental observations, reveal a near-linear relationship between eavesdropping intensity and QBER, with values approaching 25% under full intercept-resend attacks. Four confidence interval estimation methods, Wald, Wilson, Clopper-Pearson, and Hoeffding's inequality, are compared for robust QBER analysis in finite-key scenarios. Protocol enhancements, including decoy-state methods, hybrid cryptographic models, and quantum-resistant authentication, are discussed as mechanisms to mitigate errors and strengthen resilience across fiber, free-space, underwater, and satellite QKD systems. Open challenges in distinguishing noise-induced errors from malicious eavesdropping, and the role of adaptive error correction and machine-learning-assisted QBER estimation in future quantum networks, are identified as key directions for further research.
The one-time pad is an encryption technique that is proven to be unbreakable by an eavesdropper. It relies on a single-use secret key shared between a sender and a receiver, whose length is that of the message to be encrypted. The creation of such a key can be achieved through Quantum Key Distribution (QKD), a method based on quantum physics that ensures eavesdroppers' actions can be statistically detected with arbitrarily high probability. It requires a quantum channel for qubit transmission and a classical channel for classical bit transmission. However, the classical channel is generally authenticated by classical means using cryptographic hash functions that are not provably secure. In this paper, we propose for the first time a QKD protocol, based on BB84, that uses quantum error estimation to authenticate both channels. This method relies on the consumption of a smaller pre-shared key, and is provably secure thanks to fundamental results in both information theory and quantum physics.
An explicit attack on the distributed key is presented for the BB84 quantum cryptography protocol. In this attack, the theoretical maximum of the eavesdropper’s (Eve’s) information on the key is reached at the minimum possible error Q at the receiver end. Eve’s maximum information is reached in collective measurements, which are constructed in the explicit form and are performed by Eve at the very end of the protocol. The situation in the critical error range 11% < Q c < 15% is determined.
The security of cryptographic keys in quantum cryptography systems is guaranteed by fundamental quantum mechanical exclusion principles. A quantum channel through which quantum states are transferred is not controlled and an eavesdropper can perform any modifications with it. The security of quantum key distribution protocols has already been proved [M. Tomamichel et al., Nature Commun. 3 , 634 (2011); S. N. Molotkov, J. Exp. Theor. Phys. 115 , 969 (2012)], including the realistic case of a finite length of transmitted sequences. It is always assumed that the eavesdropper has neither direct nor indirect access to the transmitting and receiving equipment. The real situation is somewhat different. The preparation and detection of quantum states occur according to random sequences that are generated on the transmitter and receiver sides. Detecting electromagnetic radiation generated in these processes, the eavesdropper can obtain additional information on a key. The upper quantum-mechanical bound on the amount of information of the eavesdropper on the key that can be obtained through a side channel has been determined.
We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually.