In the summer of 1984, Charles Bennett and Gilles Brassard published a four-page paper proposing a method for distributing cryptographic keys whose security was guaranteed not by the difficulty of a mathematical problem, but by the laws of physics. The paper described what became known as BB84 — the first quantum key distribution protocol — and it rested on a single, profound observation: any attempt to intercept a quantum communication must disturb it, and that disturbance is detectable.

Forty years later, BB84 remains the most widely implemented QKD protocol in the world. Understanding it in detail reveals not just how quantum cryptography works, but why it works — and what the honest limits of that guarantee are.

Key Concepts in This Article

Polarisation

The orientation of a photon's electric field oscillation — used in BB84 to encode the two values of each qubit.

Measurement Basis

The reference frame used to read a qubit. Measuring in the wrong basis yields a random, useless result.

QBER

Quantum Bit Error Rate — the fraction of sifted key bits that disagree. Rises from ~1% to ~25% when an eavesdropper is present.

No-Cloning Theorem

The quantum mechanical prohibition on copying an arbitrary unknown quantum state — the reason eavesdropping cannot be passive.

How BB84 Works

BB84 uses single photons as its information carriers. A photon’s polarisation — the orientation of its oscillating electric field — can be prepared in four states across two measurement bases:

Alice, the sender, generates a random stream of bits. For each bit, she also randomly selects a basis — rectilinear or diagonal — and sends a photon polarised accordingly. Bob, the receiver, randomly and independently selects a basis for each photon he measures. When his basis matches Alice’s, his result is deterministic and correct. When they differ, quantum mechanics dictates that his result is completely random — a coin flip with no correlation to Alice’s original bit.

BB84 KEY EXCHANGE — EXAMPLE SEQUENCE Alice bit Alice basis Bob basis Bases match? Key bit 1 0 1 1 0 1 0 1 0 1 0 1 1 ⊕ rectilinear ⊗ diagonal ✓ bases match → key bit kept ✗ discarded
Figure 1 — An eight-bit BB84 exchange. Alice and Bob independently choose random bases for each photon. After the quantum transmission, they compare bases publicly and discard bits where their choices differed. The five remaining bits form the raw sifted key.

After transmission, Alice and Bob compare their chosen bases over a public (but authenticated) classical channel — they reveal which basis they used for each bit, but not the bit values themselves. Bits where their bases matched are kept; the rest are discarded. This sifted key is the raw shared secret. On average, bases agree half the time, so roughly half the transmitted bits survive sifting.

Why an Eavesdropper Cannot Hide

This is where quantum mechanics becomes the security mechanism.

Suppose Eve intercepts each photon as Alice sends it. To learn the bit value, she must measure the photon. But she does not know which basis Alice used. If she guesses correctly, she measures correctly and re-sends an identical photon to Bob. If she guesses wrong — which happens 50% of the time — she measures in the wrong basis and gets a random result. She then re-encodes and sends a photon in her (wrong) basis to Bob.

When Bob subsequently measures that photon in Alice’s original (correct) basis, there is now a 50% chance his result disagrees with Alice’s original bit. The net effect: for every intercepted bit, there is a 25% probability of introducing an error in the sifted key. An eavesdropper covering the entire channel introduces a Quantum Bit Error Rate (QBER) of approximately 25%.

After sifting, Alice and Bob sacrifice a random subset of their key bits — comparing them publicly to measure the QBER. If the error rate is below an agreed threshold (typically 11% for standard BB84), they conclude the channel is sufficiently secure. If it exceeds that threshold, they abort and try again.

The QBER: Measuring the Presence of an Eavesdropper

QBER UNDER DIFFERENT CONDITIONS 11% threshold 30% 15% 11% 5% 0% ~2% No eavesdropper (channel noise only) ~14% 50% interception (detectable) ~25% Full interception (obviously detected)
Figure 2 — QBER as a function of eavesdropping. A quiet channel shows ~1–3% error from photon loss and detector imperfection. Partial interception pushes the QBER above the 11% abort threshold. Full interception by a naive eavesdropper produces ~25% errors — unmistakably detectable.

After Sifting: Privacy Amplification and Error Correction

A QBER below the security threshold does not mean the key is immediately usable. Two further steps are required.

Error correction reconciles the small number of discrepancies between Alice’s and Bob’s sifted keys caused by channel noise — detector inefficiency, optical imperfections, background photons — rather than eavesdropping. Classical error-correcting codes are applied over a public channel. This necessarily reveals some information about the key to any eavesdropper who might be listening.

Privacy amplification compensates by shortening the key using a hash function agreed in advance. By compressing the key to a fraction of its sifted length, Alice and Bob can reduce Eve’s information about the final key to an arbitrarily small quantity — at the cost of producing fewer key bits. The final key is shorter but provably secure: information-theoretically secure, meaning no adversary, regardless of computational power, can recover it from the intercepted signals.

1984

Year BB84 was proposed — the founding paper of quantum cryptography

25%

QBER introduced by a naive eavesdropper covering the entire channel

7,600 km

Distance of the China-Austria intercontinental QKD demonstration via Micius satellite

Real-World Constraints

BB84’s security is unconditional in theory. In practice, several constraints limit its deployment.

Distance. Single photons attenuate in fibre exponentially with distance. A direct fibre link for QKD is practical up to roughly 300–400 kilometres before the key rate becomes too low to be useful. Classical amplification is not possible — you cannot copy a quantum state — so extending range requires trusted relay nodes or satellites.

Trusted nodes are the current solution for terrestrial networks. A QKD link is established from Alice to an intermediate node, where the key is stored in classical memory and re-encrypted for the next hop. This works, but the intermediate node is a security assumption: if it is compromised, the key security is compromised. China’s Beijing–Shanghai QKD network uses 32 such trusted relay nodes.

Satellite QKD removes the trusted-node limitation for long distances. Photons travel through vacuum rather than fibre, reducing loss. China’s Micius satellite established QKD with ground stations at distances up to 1,200 km in a single satellite pass, and completed an intercontinental key exchange with Austria in 2021 using the satellite as a trusted node.

QKD Milestones

1984

BB84 protocol proposed by Bennett and Brassard at a Montreal conference

1989

First experimental demonstration at IBM — 32 cm through open air

2004

First bank transfer secured by QKD, Vienna — the first commercial application

2017

China's Micius satellite demonstrates satellite-to-ground QKD over 1,200 km

2021

Intercontinental QKD between China and Austria, 7,600 km via Micius

2023

UK National Quantum Network operational, connecting Cambridge, Bristol, and London

Key Takeaways

  • BB84 security rests on the no-cloning theorem and the disturbance any measurement causes to a quantum state — not on computational assumptions.
  • An eavesdropper intercepting all photons introduces a detectable 25% QBER. The 11% abort threshold provides a safety margin above real channel noise.
  • Privacy amplification and error correction convert a noisy sifted key into a shorter, information-theoretically secure final key.
  • Real-world limitations — distance, trusted nodes, detector efficiency — are engineering constraints, not breaks in the underlying security proof.
  • QKD and post-quantum cryptography are complementary, not competing: QKD secures key exchange; PQC secures the computational protocols that use those keys.

BB84 turned forty in 2024. The protocol that Bennett and Brassard described in four pages has been implemented in fibre, free space, and across 7,600 kilometres of atmosphere via satellite. Its security proof has been extended, strengthened, and subjected to forty years of cryptanalytic scrutiny. No fundamental break has been found.

The reason is not that the engineering is perfect — it is not. Trusted nodes are attack surfaces; detector inefficiencies have enabled side-channel attacks; photon sources are imperfect. The reason BB84 survives is that its core security claim — eavesdropping disturbs the quantum channel, and disturbance is measurable — is a consequence of quantum mechanics itself. And quantum mechanics, so far, remains unbroken.

Sources & Further Reading

  1. Charles H. Bennett, Gilles Brassard. Quantum Cryptography: Public Key Distribution and Coin Tossing. Proc. IEEE Int. Conf. on Computers, Systems and Signal Processing, Bangalore (1984)
  2. Peter W. Shor, John Preskill. Simple Proof of Security of the BB84 Quantum Key Distribution Protocol. Physical Review Letters 85, 441; arXiv:quant-ph/0003004 (2000)
  3. Nicolas Gisin, Grégoire Ribordy, Wolfgang Tittel, Hugo Zbinden. Quantum Cryptography. Reviews of Modern Physics 74, 145; arXiv:quant-ph/0101098 (2002)

Discussion

← All articles