Quantum Cryptography
Quantum Cryptography
ISSN 1896–5334
Vol.21 (2009), no. 3-4
pp. 149–166
Quantum Cryptography
Abstract: Current popular exchange of cryptographic keys using public key cryptography suffers
from two major flaws. First, it is vulnerable to technological progress. The development of the first quantum
computer will consequently make the exchange of a key with public key algorithms insecure. The second
flaw is the fact that public key cryptography is vulnerable to progress in mathematics. These threats simply
mean that public key cryptography cannot guarantee future-proof key distribution. Quantum cryptography
solves the key distribution problem by allowing the exchange of a cryptographic key between two remote
parties with absolute security, guaranteed by the laws of physics. Mechanics of this exchange has been
described in the paper. The quantum cryptography system is very promising and advancements are being
made to improve upon the technology, most notably a wireless implementation, but it is still susceptible to
hacker attacks and has transmission distance and encryption rate limitations. This paper will discuss the
flaws of quantum cryptographic systems along with the plans for enhancing current quantum cryptographic
systems.
Keywords: brak
– Quantum dots. Small devices that contain a tiny droplet of free electrons
– And many others
Otto Stern and Walther Gerlach performed in 1922 so called Gerlach experiment
often used to illustrate basic principles of quantum mechanics on the deflection of par-
ticles. They demonstrated that electrons are spin 1 /2 particles. These have only two
possible spin angular momentum values, called spin-up and spin-down (Fig. 1). Spin of
electrons can be considered as an equivalent to binary system. In the experiment spin-up
could mean logical 0, and spin-down could mean logical 1.
A significant step in utilization of quantum mechanics laws has been use of light in
quantum cryptography. Light can be polarized in many ways. Polarization of light is
the direction of oscillation of the electromagnetic field associated with its wave. Fig. 2
demonstrates a principle of horizontal and vertical polarization of light with the use of
crystals.
Ideally, in the absence of noise, any discrepancy between Alice’s and Bob’s raw keys
is proof of Eve’s intrusion. So to detect Eve, Alice and Bob select a publicly agreed upon
random subset of m bit locations in the raw key, and publicly compare corresponding
bits, making sure to discard from raw key each bit as it is revealed. Should at least one
comparison reveal an inconsistency, then Eve’s eavesdropping has been detected.
In reality, noise unavoidable due to technical, material reasons, introduces errors
still with the assumption that all errors in raw key are caused by Eve. Comparison in the
subset m will then reveal errors at an estimate R of the error-rate. If R exceeds a certain
threshold Rmax , then Alice and Bob would repeat transmission to start over, otherwise
revealed error bits will be removed from the key. Then a process of reconciliation called
also a key distillation will follow.
First step in this process employs a classical error correction protocol, to get a shorter
key without errors, reducing error rate from few percent to usual 10−9 . After error cor-
rection, Alice and Bob have identical copies of a reconciled key, but Eve may still have
some information about it, therefore it is only partially secret from Eve. The next step
is the privacy amplification, being the process whereby Alice and Bob reduce Eve’s
knowledge of their shared bits to an acceptable level. This technique is also sometimes
called advantage distillation. Privacy amplification is used to convert the realized rec-
onciled key into a smaller length key through some hashing function chosen at random
from a known set of hashing functions.
The B92 protocol is an extension of BB84, which shows how photons with non-
orthogonal states can be used to distribute a secret key [24]. As in BB84, Alice and Bob
communicate in two stages, the first over a one-way quantum channel, and the second
over a two-way public channel. Unlike BB84, which requires two incompatible orthog-
onal quantum alphabets, B92 requires only a single nonorthogonal quantum alphabet. In
the B92 coding scheme, the bit b = 0 is encoded by a photon with horizontal polarization
and the bit b = 1 is encoded by a photon with diagonal polarization at 45◦ .
In the first stage, Alice is required, each time she transmits a single bit, to use ran-
domly with equal probability either of two nonorthogonal pure states from the alphabet
Aθ . Since no measurement can distinguish two non-orthogonal quantum states, it is
impossible to identify the bit with certainty. Moreover, any attempt to learn the bit will
modify the state in a noticeable way. Bob performs a test which provides him with a con-
clusive or inconclusive result, using one of many possible measurement strategies, such
as suggesting that the measurements will be based on the two incompatible experiments.
Stage 2 for the B92 protocol is similar to that for the BB84 protocol. Alice and Bob
use a public channel to inform which bits were identified conclusively, and to compare
some of the common bits in order to estimate the error rate. They must accept some
small error rate due to imperfections in handling the quantum states. If the estimated
error rate exceeds the allowed error rate they return to stage 1 and start over.
Another encoding scheme gaining popularity, also called the Ekert encoding scheme
(E91), is similar to BB84, but is based on two photons, called entangled photons.[2]
These photon pairs can be created by either Alice, Bob or a third party by splitting a
single photon into two, using a laser. After the split, one of the photons is sent by
the sender or on behalf of the sender to the receiver while the other photon is kept.
The entangled photons follow a principle similar the Heisenberg’s Uncertainty Principle
where disturbing, monitoring or measuring the state of one entangled photon will disturb
the other entangled photon no matter how far apart the entangled paired photons are
separated. This property was described as the EPR Paradox (Einstein, Podolsky, Rosen)
questioning completeness of the quantum mechanics theory.
155
The EPR quantum protocol is a 3-state protocol that uses Bell’s inequality. In the
first stage occurring over the quantum channel, for each time slot, a state is randomly
selected with equal probability from the set of states. Than an EPR pair is created in the
selected state. One photon of the constructed EPR pair is sent to Alice, the other to Bob.
Alice and Bob at random with equal probability separately and independently select one
of the three measurement operators, and accordingly measure their respective photons.
Alice records her measured bit. On the other hand, Bob records the complement of his
measured bit to detect the presence or absence of Eve as a hidden variable.
In stage 2 Alice and Bob discuss over a public channel which measurement basis
they used for each photon. The two parties then separate the bits of the transmission
into two groups called raw key and rejected key. The raw key group contains the bits
where Alice and Bob used the same basis for measurement. The rejected key group
contains all the other bits. Now, Alice and Bob compare over a public channel their
respective rejected key. If their comparison satisfies Bell’s inequality then a third party
has been detected, then the entire process is repeated. Otherwise the raw key is retained.
Unlike the BB84 and B92 protocols, the EPR protocol, instead of discarding rejected
key, actually uses it to detect Eve’s presence. Alice and Bob now carry on a discussion
over a public channel comparing their respective rejected keys to determine whether or
not Bell’s inequality is satisfied. If it is, Eve’s presence is detected. If not, then Eve is
absent, and the remainder of the protocol is similar to that of BB84.[9]
First, a source of entangled (EPR) particles is prepared. Sender and receiver share
each particle from a pair emitted by that source. Second, a Bell-operator measurement is
performed at the sender on his EPR particle and the teleportation-target particle, whose
quantum state is unknown. Third, the outcome of the Bell measurement is transmitted
to the receiver via a classical channel. This is followed by an appropriate unitary oper-
ation on the receiver’s EPR particle. The name “teleportation” is justified by the fact
that the unknown state of the transfer-target particle is destroyed at the sender site and
instantaneously appears at the receiver site. Actually, the state of the EPR particle at the
receiver site becomes its exact replica, but the teleported state is transported between the
two sites without transferring the media containing information, therefore it should be
immune from eavesdropping.
BBN Technologies (Cambridge, MA) operates the world’s first quantum crypto-
graphic network, which links several different kinds of QKD systems (Fig. 9). Some
use off-the-shelf optical lasers and detectors to emit and detect single photons; others
use entangled pairs of photons. This DARPA-funded network runs between BBN, Har-
vard, and Boston University, a city sized schematic designed to test the robustness of
such systems in real-world applications [3].
BBN security model is the cryptographic Virtual Private Network (VPN), where ex-
isting VPN key agreement primitives are augmented or completely replaced by keys pro-
vided by quantum cryptography. The remainder of the VPN construct is left unchanged;
see Fig. 9. Thus such QKD-secured network is fully compatible with conventional
Internet hosts, routers, firewalls, and so on.
The network, which is based in Vienna, Austria, was developed under the integrated
EU project “Development of a Global Network for Secure Communication Based on
Quantum Cryptography” (SECOQC). The Vienna network consists of six nodes and
eight intermediary links with distances between 6 and 82 km. There are seven links
utilizing commercial standard telecommunication optical fibres and one free-space link.
Toshiba, UK supplied hardware to the Vienna network and sites connected in the network
were Siemens sites.
158
Equipment from id Quantique has been successfully used in Geneva electronic vot-
ing.
US based MagicQ, Inc. is another quantum technology vendor. MAGIQ QPN 8505
Security Gateway is a highly-compatible, hardware-based, VPN security solution built
on quantum cryptography [7]. MagiQ QPNTM solves the problem of refreshing en-
cryption keys regularly as often as 100 times per second by incorporating real-time,
continuous, symmetrical quantum key generation based on truly random numbers.
MagiQ QPNTM 8505 comprises of a set of industry standard protocols including
BB84, IPSEC based VPN and AES. MagiQ QPNs were implemented in the DARPA
network in Boston, MA.
159
Subscriber Identity Module (SIM) contains a 128 bit symmetric key that is shared with
the subscriber’s network service provider. This key is used in an authentication protocol,
one product of which is a new symmetric data encryption key, similar way as QKD
systems do.
Let us now consider the security of the non-ideal protocol, taking into account un-
avoidable technical imperfections.
A major problem in the implementation of BB84 is generation of a single-photon
state. In most experiments, an attenuated coherent laser source is used instead of a
perfect single-photon source. All photon sources so far have some probability of multi-
161
photon emission, from which Eve can obtain information by exploiting the so-called
photon number splitting (PNS) – see Fig. 12.
Eve may suppress single-photon signals, and allow passing only those signals that
she can split. Since this attack is one of the greatest threats to BB84, protocols with PNS
tolerance have been considered. The differential phase shift (DPS)-QKD [17], SARG04
protocol [18], and decoy state method [19], [20], [10] are examples of such protocols or
PNS-attack-resistant methods.
Increased interest in researching quantum attacks gradually evolved to include such
imperfections of physical apparatus as faint pulse sources (as opposed to true single
photon sources), loss in the transmission line and non-ideal detectors [25]. Most com-
mercial quantum links have two detectors, each tuned to detect protons in one of the two
different polarisation states – "1" or "0" – used to make up the secret code. Hoi-Kwong
Lo at the University of Toronto in Canada realized [4] that small imperfections in the
design of the photon detectors mean they aren’t quite switched on at the same instant,
and for a few picoseconds only one will be on. Eve can make sure the photon arrives at
Bob when only his "1" detector is open. Now, if Bob registers a click and tells Alice,
Eve knows that the photon was in the "1" state. Lo claims that their team was able to
hack a commercial quantum communications device 4% of the time. Just recently id
Quantique said that they were able to fix loopholes exploited by Professor Lo.[21]. Eve
is assumed to know everything about Alice’s and Bob’s equipment. Thus, Eve can fully
exploit every imperfection that exists in legitimate parties’ hardware and software.
Makarov [11],[12] explores successful attacks on commercial single-photon detec-
tors, using fake state pulses, utilizing equipment imperfections. Using bright light Eve
can blind Bob’s detectors forcing them to become totally insensitive to single photons
as well as dark counts and afterpulses, only producing an output pulse (a “click”) when
a brighter optical pulse is applied at its input. With such a control mode Eve could
intercept each quantum bit encoded by Alice with an exact replica of the detection appa-
ratus used by the Bob, then send a faked state targeting the corresponding detector at the
162
receiver’s side, allowing Eve to get a complete copy of the cryptographic key without
being noticed unless light intensity across the link is monitored.
Finally, QKD security is always relying on an implicit assumption: Alice and Bob,
who are storing the final symmetric secret keys in classical memories, must be located
inside secure environments. If there is a channel allowing to spy on the keys, stored
in a classical memory, then the security of the keys is compromised. Providing that
QKD devices are partly made of classical objects, it is essential that such interfaces are
designed with great care.
5. Other challenges
Speed of key exchange and reachable distance of QKD links are challenging factors
today. According to SECOQC reports as of 2007 [13] one can expect to exchange be-
tween 1 and 10 kbits of secret key per second, over a point-to-point QKD link of 25 km
(at 1550 nm, on dark fibres). The maximum span of QKD links is roughly 100 km at
1550 nm on telecom dark fibres. This range is suitable for metropolitan area scale QKD.
Both secret bit rate and maximum reachable distance are expected to continue their pro-
gression during the next years due to combined theoretical and experimental advances.
Significant speed increase is expected in forthcoming future, though it will require very
fast detectors at telecommunications wavelengths, with good quantum efficiency and
low dark count.
Use of trusted relays QKD network can increase distance reacheable by QKD link.
[13]. The relay nodes need to be trusted, although having the sender use a secret sharing
scheme can reduce trust. It is particularly useful when the network operator is already
a network user, as in the case of internal bank networks. Global key distribution is
performed over a QKD path, i.e. a one-dimensional chain of trusted relays connected by
QKD links, establishing a connection between two end nodes, as shown on Fig. 13.
Secret keys are forwarded, in a hop-by-hop fashion, along QKD paths. To ensure
their secrecy one can use one-time pad encryption and unconditionally secure authenti-
cation, both realised with a local QKD key. The trusted relays QKD network has been
used in the DARPA and Vienna Network.
One of the main targets of the free-space QKD system is to construct an Earth-
satellite link. Several groups have published detailed modeling to show that low-Earth
163
orbit satellite-to-ground QKD would be feasible even in daylight, with typical ranges of
∼1.000 km [15].
Key Pre-Distribution can pose another challenge for system initialization. After ini-
tialization QKD-generated keys can then be stored and used for later authentication. For
the network of n nodes this may lead to n(n–1)/2 pairs of secret keys distributed, but
thanks to possibility of playing with betwork connectivity, the problem can be reduced
to linear one [13].
6. Conclusions
Quantum key distribution solves the key distribution problem with security based
on the laws of physics, but it is important to develop network architecture able to fully
benefit from the possibilities offered by point-to-point, distance limited QKD links.
Few experimental demonstrations have included all of the ingredients of a full QKD
protocol, and their focus has been almost exclusively on closing the gap between the
idealized assumptions of “theoretical secrecy” proofs for QKD and the realities of im-
perfect realizations of fundamental quantum processes. As the technology continues
to evolve into more mature stage, it is apparent that QKD is capable of significantly
and positively impacting information-security requirements without insisting on theo-
retically perfect secrecy from inevitably imperfect physical realizations. According to
a roadmap projected by the Quantum Cryptography Technology Experts Panel [14], at
least two distinct practical roles for QKD are possible within future networked optical
communications infrastructures
The roadmap sets out specific goals that will stimulate the necessary basic theoretical
and experimental physics research and advances in the enabling component technolo-
gies. The roadmap has been a living document, updated on an annual basis to reflect
progress.
The latest Updating Quantum Cryptography Working Group Report [1] outlines the
standardization of quantum cryptography. Specifically it raises issues of the interop-
erability specifications and requirements. One is the interoperability between quantum
cryptographic technology and contemporary cryptographic systems and the other is that
among quantum cryptosystems. It also refers to issues relating to test requirements.
164
References
15. J.G. Rarity, P.R. Tapster, P.M. Gorman, P. Knight: “Ground to satellite secure key ex-
change using quantum cryptography,” New Journal of Physics 4, 82.1-82.9 (2002).
16. Ch. H. Bennett, G. Brassard, Quantum cryptography: Public key distribution and coin
tossing, International Conference on Computers, Systems & Signal Processing, Bagalore,
India, December 10–12, 1984, pp. 175–179.
17. K. Inoue, E. Waks, Y. Yamamoto: “Differential Phase Shift Quanum Key Distribution,”
Physical Review Letters 89, 037–902 (2002).
18. V. Scarani, A. Acin, G. Ribordy, N. Gisin: “Quantum Cryptography Protocols Robust
against Photon Number Splitting Attacks for Weak Laser Pulse Implementations,” Physi-
cal Review Letters 92, 057–901 (2004).
19. W.-Y. Hwang: Quantum key distribution with high loss: Toward global secure communi-
cation. Phys. Rev. Lett., 91(5):057901, 2003 doi:10.1103/PhysRevLett.91.057901. eprint
arXiv:quant-ph/0211153.
20. X.-B. Wang: “Beating the Photon-Number-Splitting Attack in Practical Quantum Cryp-
tograpy,” Physical Review Letters 94, 230–503 (2005).
21. C. Barras: Quantum computers get commercial – and hackable, New Scientist, Apr. 2009.
22. P. D. Townsend, I. Thompson: Journal of Modern Optics, A quantum key distribution
channel based on optical fibre, Vol. 41, No. 12, 1994, pp. 2425–2433.
23. B.C. Jacobs, J.D. Franson: Quantum cryptography in free space, Optics Letters, Vol. 21,
November 15, 1996, pp. 1854–1856.
24. H. Ch. Bennett: Quantum cryptography using any two nonorthogonal states, Physical
Review Letters, Vol. 68, No. 21, 25 May 1992, pp. 3121–3124.
25. V. Makarov, D. Hjelme: Faked states on quantum cryptosystems, J. Mod. Opt. 45, pp.
2039–2047, 2001.
26. N. Gisin, G. Ribordy, W. Tittel, H. Zbinden: Quantum cryptography, Reviews of Modern
Physics, Vol. 74, January 2002.
27. N. Anscombe: Quantum cryptography: Vienna encrypts com, OLE, Jan. 2009 op-
tics.org/ole.
Kryptografia kwantowa
Streszczenie