SlideShare a Scribd company logo
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
DOI:10.5121/ijcis.2014.4202 13
CRYPTOGRAPHY FROM QUANTUM MECHANICAL
VIEWPOINT
Minal Lopes1
and Dr. Nisha Sarwade2
1
Department of Electrical Engineering, VJTI, Mumbai, India
2
Department of Electrical Engineering, VJTI, Mumbai, India
ABSTRACT
Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed
the security through encryption of their data, with the help of a common key. Both the parties should agree
on this key prior to communication. The cryptographic systems which perform these tasks are designed to
keep the key secret while assuming that the algorithm used for encryption and decryption is public. Thus
key exchange is a very sensitive issue. In modern cryptographic algorithms this security is based on the
mathematical complexity of the algorithm. But quantum computation is expected to revolutionize computing
paradigm in near future. This presents a challenge amongst the researchers to develop new cryptographic
techniques that can survive the quantum computing era. This paper reviews the radical use of quantum
mechanics for cryptography.
KEYWORDS
Quantum cryptography (QC), Quantum key Distribution (QKD), Quantum Mechanics, Bell’s Theorem
1. INTRODUCTION
In 1984, Bennett (from IBM Research) and Brassard (from University of de Montreal) presented
an idea of using quantum mechanics for cryptography (Quantum Cryptography). They proposed
an algorithm (BB84) based on Heisenberg’s ‘uncertainty principle’ for exchanging the key (QKD)
along with a classical one-time pad (OTP) for information exchange [1]. After BB84, almost a
decade later in 1991, Ekert reconsidered QC but with another unique principle of quantum
mechanics known as ‘Quantum Entanglement’ [2]. Since these two base papers, many researchers
have contributed towards QC protocols. All these protocols can be briefly divided in two
categories, protocols based on ‘Uncertainty principle’ and based on ‘quantum Entanglement’ [3].
Though there is ample contribution towards development of protocols, the practical
implementation of these protocols rather faces much more complications which make QC
vulnerable. The Photon number splitting (PNS) attacks [4], a side channel attack [5], and
imperfections in detectors [6] shows that QKD device imperfections need to be addressed. This
gives rise to new category of protocols known as Device Independent (DI) QKD and
Measurement Device Independent (MDI) QKD protocols.
The focus of this paper is on basic understanding of Quantum Cryptography and the underlying
quantum principles while traversing along the roadmap of major QC protocol design evolution.
The organization of this paper is as follows: In section II, we will discuss fundamentals of QKD
and basic protocols based on Heisenberg’s uncertainty principle. Section III will brief on
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
14
evolutionary protocols based on Bell’s theorem and quantum entanglement. In Section IV we will
discuss the need for advanced protocol design and its approach using the principle of non locality
and no signalling principle. We will also discuss the modern secure QKD protocol design through
an example.
2. BASIC QKD PROTOCOLS
2.1. Fundamentals of QKD
The basic model of QKD protocol is shown in fig.1. It includes two classical users Alice and Bob,
connected through quantum and classical communication channel, wishing to communicate
securely. The quantum channel is used to exchange the key, whereas classical channel is used for
actual information transfer.
Figure 1. Basic QKD Model
Figure shows Eve as a malicious eavesdropper, who have access to both the channels and is
assumed to have infinite resources. Having this model established let us discuss the general steps
involved in any QKD protocol. A typical QKD protocol comprises eight stages [7]:
1. Random number generation by Alice(Sender)
2. Quantum communication
3. Sifting (basis reconciliation)
4. Reconciliation
5. Estimation of Eve’s partial information gain
6. Privacy amplification
7. Authentication of public messages
8. Key confirmation.
First, Alice (the sender) generates a sequence of random numbers from a hardware or software
random number generator. Then, using the specified QKD protocol she encodes these random bits
into the quantum states of a sequence of signals from her quantum light source and sends them
over a “quantum channel” to Bob (the receiver). Bob applies a quantum measurement to each
received signal and assigns it a bit value.
Next, Bob informs Alice over a classical channel, in which time slots he detected photons, but
without revealing the bit value he assigned to each one. The bit strings corresponding to the
signals detected by Bob are known as raw keys. Then, Alice and Bob select by public discussion a
Quantum channel
Classical channel
Alice
Eve
Bob
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
15
random portion of their raw keys, known as sifted keys. In an ideal system Alice and Bob’s sifted
key bits would be perfectly correlated.
In practice, Bob’s sifted key is not perfectly correlated with Alice’s. It contains transmission
errors arising from background photons, detector noise and polarization imperfections. A typical
error rate of 1 to 5 percent is presented by various literatures [8]-[10]. These errors must be
located and corrected. Bob reconciles his sifted key with Alice’s using an error correction method
over their public channel, during which parity information about the sifted key is leaked. Their
perfectly correlated reconciled keys are only partially secret now.
From the number of errors that Alice and Bob find in Bob’s sifted key they are able to estimate an
upper bound on any partial information that Eve might have been able to obtain on Alice’s
transmitted bit string. Quantum mechanics ensures that Eve’s measurements would introduce a
disturbance (errors) into Bob’s sifted key that would be strongly correlated with Eve’s partial
information gain from them.
Alice and Bob extract from their reconciled keys a shorter, final bit string on which Eve’s
expected information is much less than one bit after an information-theoretic procedure known as
“privacy amplification”. In this procedure they use further public communications to agree to
hash their reconciled keys into shorter final secret keys. For example, if Alice and Bob have 6
reconciled bits and their bound on Eve’s information tells them that at most she knows 3 of these
bits, they can agree to form two secret bits by XORing together the first 4 bits and the final 4 bits.
Eve would have to guess at least one of the bits being XORed in each case and so would be
ignorant of the outcome. These two bits are therefore suitable for use in a cryptographic key.
More generally, Alice and Bob can form their final secret bits from the parities of random subsets
of their reconciled bits [11].
2.2. The BB84 Protocol
BB84 is based on ‘uncertainty principle’ which states that unlike digital data the quantum data
cannot be copied or measured without disturbing it. This immediately intimates that the
eavesdropper cannot gain even a partial data without altering it. Also these alterations are most
likely to be detected, solving the root cause problem of cryptography, known as ‘eavesdropping’.
This gives a radically different foundation for cryptography. In BB84, Alice generates a sequence
of random numbers and encodes them using basis shown in Fig. 2. She chooses this basis
randomly and transmits the polarized photon to Bob.
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
16
Figure 2. BB84 Encoding
Bob now measures the polarization of each received bit by choosing a random basis per bit. Now
according to theory of probability, Alice and Bob are expected to choose same basis for more
than 50% of cases on an average. Thus in an ideal case, with no eavesdropping and no
transmission errors, the quantum bit error rate (QBER) of the transmission will be less than 50%.
But Eve’s presence will increase the QBER to more than 75% (ideally). This is illustrated in
TABLE I and II through an example.
Table 1. Working of BB84 protocol without eavesdropping
0°, binary 0
45°, binary 0
90°, binary 1
135°, binary 1
Rectilinear Basis Diagonal Basis
Photon Polarization
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
17
From table I, it is clear that the QBER is less than 50% (13/29*100=44.82%, considering
transmission errors), which is acceptable. Thus Alice and Bob can decide to continue the
communication. In such case the sifted keys of both the parties will be partially correlated due to
transmission errors. These errors can easily be removed by reconciliation process of ‘parity
check’. Table II depicts the case of presence of eavesdropper and transmission errors. Here the
QBER is very high (24/29 *100 = 82.75% which is > 50%). This indicates the presence of
eavesdropping in the communication. Both the parties can abort the transmission now.
BB84 have used quantum properties is such an efficient manner, that it has become the base for
quantum cryptography. The disadvantage of BB84 is its assumptions for ideal quantum sources
and detectors, which makes it vulnerable to PNS and detector noise attacks. Many other variants
of it exist including B92 [12] using only two orthogonal states, SSP99 [13] using six states on
three orthogonal bases. This means that an eavesdropper would have to choose the right basis
from among 3 possibilities. This extra choice causes the eavesdropper to produce a higher rate of
error thus becoming easier to detect.
Table 2. Working of BB84 protocol with eavesdropping and Transmission Errors
W - Wrong, C - Correct
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
18
While there are number of other BB84 variants, one of particular interest was proposed in 2004
by Scarani, Acin, Ribordy, and Gisin named SARG04 [14] due to its capability of detecting the
photon number splitting attack.
2.3. The SARG04 Protocol
This protocol is a modification of BB84 in sifting process. The bases used are non orthogonal
states as shown in Fig (3), which cannot be discriminated deterministically. Also instead of
revealing the bases, Alice announces the random states that she has used in preparing her photons.
These random non orthogonal states can be defined as,
{ } { } )(,,with,, ''
, ' IwwzwwxA ww −+∈=
Where, x± code for 0 and z± code for 1
a1 a0
b0 b1
Figure 3. Two pairs of Non-orthogonal states in SARG04
The protocol is explained through an example in table III. Now when Alice sends these states,
Bob will again measure the standard deviation against each polarization in that state. In any of the
states if he gets the negative result, it indicates that Alice certainly has send the opposite state.
SARG04 has sifted key rate of 25% as compared to 50% for BB84. But it increases the
attenuation for pulses with one and two photons, thus indicating the presence of eavesdropping in
case of weak coherent pulses. This makes it robust against PNS attack. For definiteness, in Table
3 for bit 8, Alice announces the state as A-,-. When Bob measures his photon in both the
polarizations, he gets negative result for one of the states ( ), indicating that Alice has send an
opposite state ( ).
SARG04 has ‘sifted key’ rate of 25% as compared to 50% for BB84. But the attenuation
increases specifically for pulses with one and two photons, thus indicating the presence of
eavesdropping in case of weak coherent pulses. This makes it robust against PNS attack.
Basis ‘a’
Basis ‘b’
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
19
Table 3. Working of SARG04 protocol
3. PROTOCOLS BASED ON QUANTUM ENTANGLEMENT (BELL’S THEOREM)
Entanglement is one of the most puzzling phenomena in quantum mechanics. It states that, if two
particles are entangled, measuring the properties of one particle instantly determines the state of
the second, no matter how far apart the two are [15]. Literature reveals possibilities of generating
the pairs of such entangled photons [16-17], where each photon will always have a polarization
orthogonal to the other photon. Also this polarization is indeterminate until a measurement is
made. At the instant the measurement is made the polarization of the second photon becomes
orthogonal to that of the first.
Ekert in his seminal paper [2] used this phenomenon for quantum cryptography by considering an
un-trusted source of entangled photons between Alice and Bob. He claimed that there is no
information carried by photons during transit, thus no eavesdropping. But if eavesdropper injects
extra quanta (photon) in the communication, he suggested its detection by testing the Bell’s
Inequality at either ends.
3.1 Bell’s Theorem and CHSH Inequality
Ekert’s pioneering paper [2] used Bell’s theorem for the first time to detect the eavesdropping.
Although Bell’s theorem was derived in view of EPR paradox for detection of local hidden
variables, Ekert suggested its use to detect the presence of eve in the quantum communication.
Bell’s theorem states that, “There exist predictions of quantum mechanics that are inconsistent
with the predictions of local hidden variable theories [LHVT]”. Bell [18] provided a
mathematical description for local hidden variable theories, which are hypothetical physical
theories, based on the EPR assumptions of local causality and physical reality. Bell's formalism
allows us to test these conditions experimentally by violating some inequalities (Bell
inequalities), which are satisfied by LHVT. Although there are various experiments proposed for
testing Bell’s Inequality, the most popular one is the CHSH inequality [19].
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
20
The simplified form of a CHSH inequality is,
2
)(
),(),(),(),( ''''
≤
−++=
S
IIand
baEbaEbaEbaES
Where, a and '
a are the detector settings on side A, b and '
b are the detector settings on side B.
The four combinations of these settings are tested in separate sub-experiments. The terms
),( baE etc. are the quantum correlations defined as the expectation value of the product of the
outcomes of the experiment. The mathematical formalism of quantum mechanics predicts a
maximum value for ‘S’ as 22 , which is greater than 2, and CHSH violations are therefore
predicted if the correlations are purely quantum. This property is utilized to check if Eve
malfunctions with the quantum transmission.
In 1992, Bennett, Brassard and Mermin [20] proved that E91 is the entanglement version of BB84
and any variant of BB84 could be adapted to use an entangled photon source instead of Alice
being the source. Enzer et al [21] have described an entangled version of the SSP protocol with
added security. The entanglement version of SARG04 was proposed by Fung et. al.[22]. Let us
discuss the E91 protocol as a classical example of Entanglement based protocols.
3.2 E91 Protocol
Assuming a source (EPR) that emits pairs of spin-1/2 particles, in a singlet state, first Alice and
Bob distribute n pairs of qubits in a Bell states represented as,
( ) )(0110
2
1
IIIBABA
+=+

Equation (III) represents entangled state particles (The bell states can be represented in four
different combinations of two qubits [23]) that fly apart towards Alice and Bob and can be
prepared to have spin components along one of the three directions (x, y, z) given by unit vectors
ia and )3,2,1,( =jibj having angles, 
2
1
,
4
1
,0 321 === aaa
and 
4
3
,
2
1
,
4
1
321 === bbb
, as
shown in fig. 4. The subscripts “a” and “b” refer to Alice and Bob respectively.
Figure 4. E91’s basis used by Alice and Bob in normal phase [24]
For each instance ni ,......3,2,1= , each user randomly and independently chooses the basis
(analyzer’s orientation) to perform the measurements. Later only those cases where Alice and
Bob’s measurements match are used, while others are discarded. Among the matched cases, Alice
Alice Bob
EPR
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
21
and Bob agree on some results to be used for checking phase while remaining cases being used
for normal phase.
In normal phase, each user performs )(zS measurements. The outcomes of these measurements
are perfectly correlated and thus used as a key later. In the checking phase, each user performs the
measurements for Bell’s inequality violation of the state by using only two basis as shown in fig.
5. Alice (Bob) randomly and independently chooses one between the two directions a and a′ (b
and b′) for measurements.
Then Alice (Bob) performs spin-measurements in the chosen direction. Spin-measurement in
direction p (q) is denoted as S(p) (S(q)) where p = a, a′ (q = b, b′). The probability that Alice gets
a result ±1 in spin-measurement S(p) and Bob gets a result ±1 in spin-measurement S(q) is
denoted as ),( qpP ±± . The correlation function ),( qpE is given by
)(),(),(),(),(),( IVqpPqpPqpPqpPqpE +−−+−−++ −−+=
Figure 5. E91’s basis for testing Bell’s inequality violation
and the Bell’s inequality is given by [25] (refer equation II)
)(2),(),(),(),( ''''
VbaEbaEbaEbaE ≤−++
If the particles are perfectly entangled then this inequality will produce the value of 22 , which is
greater than 2, violating the inequality. If Eve provides separable states (non entangled) to Alice
and Bob she will get detected in checking phase. If she provides perfectly entangled states, she
may pass the checking phase but will not have any information about the key. Thus E91 shows
the practical application of Bell’s theorem in cryptography, which can test the safety of the key
distribution.
4. NEXT GENERATION QKD
All though it is claimed [26-27] that the security of QC depends on the fundamental laws of
quantum physics, the working of QC protocols is based on certain assumptions. Perfect device
design (quantum sources and detectors), secure environment (physical location of legitimate
parties) are some of them. Such assumptions leave QC vulnerable. As discussed earlier, the PNS
attack exploits the replacement of single photon sources by weak coherent pulses source. The E91
assumes the detector efficiency, which if not 100% can be exploited to produce detection
loopholes. The dark count rate of detectors further leads to reduced detection efficiency which is
analogous to the losses in the quantum channel.
The solution over all these limitations is the motivation for next generation QKD protocols
known as Device- Independent QKD (DIQKD) protocols. The idea of device independency was
EPR
Alice Bob
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
22
originally derived through E91 protocol, where the source is considered untrusted and violation of
Bell’s inequality serves to decide the security of protocol. But it is proved that the violation of
Bell’s inequality can be faked by using classical light [28] and utilizing the detection loophole in
single photon detector [29]. Thus E91 is one step away from the actual DIQKD purpose. To
achieve total device independence Alice and Bob should not only distrust the source, but should
also assume that their measuring apparatuses are untrusted and controlled by Eve. We thus can
define following set of assumptions as the ultimate aim of fully DIQKD protocols [30].
1. Alice and Bob’s physical locations are secure.
2. They have trusted random number generators.
3. They have trusted classical devices to store and process the classical data.
4. They share an open authenticated classical channel.
5. Quantum physics is correct.
The pioneering papers for DIQKD were proposed by Barrett et.al. (BHK05) [31] and Acin et.al.
(AGM06)[32]. Till BHK05, the existing security proofs of QC [33-34] were based on the no-
cloning theorem.
4.1 The No-cloning Theorem
The no-cloning theorem states that “it is impossible to produce a perfect copy of an unknown
quantum state with any nonzero success probability”.
BHK05 for the first time used quantum non locality and no-signalling principle for proving the
security of QC.
4.2 Quantum Non-locality
It states that there exist some correlations that are non local and also follows the relativistic
principle of causality. The popular example of such non local correlation is quantum
Entanglement.
4.3 No-signalling Principle
The no-signalling principle states that communication between two distant parties cannot be
performed without the transmission of any physical systems, despite any physical resources that
the parties may share.
It can be shown that the quantum entanglement is consistent with relativity by satisfaction of the
no-signalling principle [35]. Thus if an eavesdropper is limited by no-signalling principle, means
he cannot prepare two or more physical systems in a joint state such that a local measurement on
one system may transfer information to another distinct system, it is possible to develop fully
device independent QKD protocols.
It was noted later that the physical implementation of BHK05 was not possible because of its
stringent requirements about Alice and Bob’s noise free channel. Also this protocol generates a
single shared secret bit by making many uses of the channel reducing the key rate to inefficient
value. The AGM06 was considered more practical DIQKD protocol.
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
23
4.4 The AGM06 Protocol
AGM06 is the modified E91 protocol as it uses Bell’s inequality for proving the security. The
strength of AGM06 is that it imparts no assumption on quantum devices (aiming towards fully
device independence) and its security depends only on prerequisite fundamental assumptions
discussed above.
As compared to E91, AGM06 expects Alice and Bob to share a quantum channel consisting of a
source that emits pairs of photons in an entangled state. Alice chooses one out of three possible
measurements )2,1,0( =xAx to perform on her photon, while Bob chooses one out of two
measurements )2,1( =yBy . The output of all measurements is the binary bits { }1,1, −+∈ba . The
raw key is then extracted from outcomes of the measurement pair { }1,0 BA . The quantum bit error
rate is defined as )1,0|( ==≠= yxbaPQ . ‘Q’ estimates the number of correlations between
Alice and Bob’s symbols, and thus quantifies the amount of classical communications needed for
error correction. The measurements 2121 and,, BBAA are used to estimate security by using the
CHSH polynomial (refer equation (II)) as given below,
)()2,2|()1,2|()2,1|()1,1|( VIyxbaPyxbaPyxbaPyxbaPS ==≠−===+===+===≤
The violation of Equation (VI) implies that in three measurement choices, Alice and Bob are
correlated, while in the fourth case they are anticorrelated. Here S > 2 is expected to ensure the
security.
5. CONCLUSION
Quantum Cryptography provides a promising future in the field of data and network security
through the fundamental quantum mechanical principles. This paper has presented a review of
foundational QC protocols along with the modern quantum principles that aids cryptography. It is
found that most protocols are based on BB84 and E91 and are vulnerable when implemented with
realistic physical devices. It is also intimated that possibility of fully equipped and post quantum
eavesdropper, puts strong limitations on feasibility of QC. Thus QC needs additional efforts and
contribution from researchers in development of protocols and testing their security.
With the development in quantum communication, this field finds tremendous scope in near
future. Therefore the implementation feasibility of QC without any assumptions needs to be
tested. The new generation protocols like DIQKD are proved secure theoretically but lack the
physical implementation. QC has still a long way to go in terms of mathematical modeling. The
performance metrics like key rate, quantum bit error rate needs to be exploited first through
mathematical and then physical modelling.
Quantum cryptography thus seems very fascinating field of research which needs collaborative
efforts from diverse fields like physics, optics, computer science and mathematics. It alongside
demands the development of various other fields like single photon sources, free space optical
communication, optical detectors which in future will also be able to provide compatibility to the
post quantum cryptographic research.
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
24
REFERENCES
[1] Bennett, C. H. and Brassard, G., "Quantum Cryptography: Public key distribution and coin tossing.",
International Conference on Computers, Systems & Signal Processing, Bangalore, India, 10-12
December 1984, pp. 175-179.
[2] Ekert, A. K., "Quantum cryptography based on Bell's theorem", Physical Review Letters, vol. 67, no.
6, 5 August 1991, pp. 661 - 663.
[3] Mart Haitjema, “A Survey of the Prominent Quantum Key Distribution Protocols”, online Available
at http://www.cse.wustl.edu/~jain/cse571-07/ftp/quantum/
[4] G Brassard, N Lütkenhaus, T Mor, BC Sanders, “Limitations on practical quantum cryptography”,
Physical Review Letters, vol.6, 1985, pp.1330-1333.
[5] Ilja Gerhardt, Qin Liu, Antia Lamas-Linares, Johannes Skaar, Christian Kurtsiefer, Vadim Makarov,
“Full-field implementation of a perfect eavesdropper on a quantum cryptography system”, Nature
communications, 2011
[6] Chi-Hang Fred Fung, Bing Qi, Kiyoshi Tamaki, Hoi-Kwong Lo, “Phase-remapping attack in practical
quantum-key-distribution systems”, Physical Review A, vol. 75, March 2007, 032314.
[7] Lütkenhaus N., “Estimates for practical quantum cryptography,” Physical Review A, Vol. 59, Jan
1999, pp 3301–3319.
[8] C. Marand, and P. D. Townsend, “Quantum key distribution over distances as long as 30 km,” Optics
Letter, Vol. 20, Issue 16, 1995, pp 1695–1697
[9] Franson, J. D., and Ilves, H., “Quantum Cryptography Using Polarization Feedback,” Journal of
Modern Optics, vol. 41,1994, pp. 2391–2396
[10] H. Zbinden, N. Gisin, B. Huttner, A. Muller, “Practical Aspects of Quantum Cryptographic Key
Distribution”, Journal of Cryptology, vol. 11,1998, pp 1–14
[11] Charles H. Bennett, Gilles Brassard, Claude Crkpeau, and Ueli M. Maurer, “Generalized Privacy
Amplification”, IEEE Transactions on Information theory, Vol. 41, No.6, nov 1995
[12] Bennett C., "Quantum cryptography using any two non-orthogonal states", Physics Review Letter,
vol. 68, 1992, pp. 3121-3124.
[13] Bechmann Pasquinucci H., and Gisin, N., "Incoherent and coherent eavesdropping in the six-state
protocol of quantum cryptography." Physics Review letter A, vol.59, 1999, pp.4238-4248.
[14] Scarani A., Acin A., Ribordy G., Gisin N., "Quantum cryptography protocols robust against photon
number splitting attacks.", Physical Review Letters, vol. 92, 2004.
[15] Jeff Hecht, “Photonics Frontiers: Entangled photons: ‘spooky action, works at a distance”, online,
Available at http://www.laserfocusworld.com/articles/print/volume-41/issue-12/features/photonics-
frontiers-entangled-photons-lsquospooky-actionrsquo-works-at-a-distance.html
[16] M Reck, P G Kwiat, “Iconic images: Entangled Photons”, online available at,
http://www.ipod.org.uk/reality/reality_entangled_photons.asp
[17] Altepeter J., E. Jeffrey, P. Kwiat. "Phase-compensated ultra-bright source of entangled
photons", Optics Express 13.22, pp. 8951-8959, 2005
[18] Bell John Stuart, “On the Einstein-Podolsky-Rosen Paradox”, Physics 1, 195–200, 1964
[19] Clauser, John F., Michael A. Horne, Abner Shimony, Richard A. Holt, “Proposed experiment to test
local hidden-variable theories”, Physical review letters 23, 1969, pp 880-884
[20] Bennet C. H., Brassard G., Mermin, N. D., “Quantum cryptography without Bell's theorem”, Phys.
Rev. Lett. 68, 1992, pp. 557-559
[21] Enzer D., Hadley P., Gughes R., Peterson C., Kwiat P., “Entangled-photon six-state quantum
cryptography”, New Journal of Physics, 2002, pp 45.1-45.8
[22] Fung C., Tamaki K., Lo H., “On the performance of two protocols: SARG04 and BB84”, Phys. Rev.,
A 73, 012337, 2006
[23] Nielsen, Michael A, Chuang, Isaac L, “Quantum computation and quantum information”, Cambridge
University Press, 2000, pp. 25
[24] Nicolas Gisin, Grégoire Ribordy, Wolfgang Tittel, Hugo Zbinden, “Quantum cryptography”, Rev.
Mod. Phys. 74, 145, March 2002
[25] Hwang Won-Young, “Bell’s inequality, random sequence, and quantum key distribution”, Physical
Review A 71.5, 2005
[26] Scarani Valerio, Helle Bechmann-Pasquinucci, Nicolas J. Cerf, Miloslav Dusek et al. “The security of
practical quantum key distribution”, Reviews of Modern Physics 81.3, 2009
International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014
25
[27] Brassard Gilles, Norbert Lutkenhaus, Tal Mor, Barry C. Sanders, “Security aspects of practical
quantum cryptography”, Springer Advances in Cryptology-EUROCRYPT, 2000
[28] Sun, Shi-Hai, Mu-Sheng Jiang, Lin-Mei Liang, “Passive Faraday-mirror attack in a practical two-way
quantum-key-distribution system”, Physical Review A 83.6, 2011
[29] Lydersen Lars, Carlos Wiechers, Christoffer Wittmann, Dominique Elser, Johannes Skaar, Vadim
Makarov, “Hacking commercial quantum cryptography systems by tailored bright illumination”,
Nature photonics 4.10, 2010 , pp. 686-689
[30] Huang Jingzheng, Yin Zhenqiang, Chen Wei, Wang Shuang, Li Hongwei, Guo Guangcan et al, “A
survey on device-independent quantum communications”, China Communications 10.2, pp 1-10,
2013
[31] Barrett J, Hardy L, Kent A, “No Signalling and Quantum Key Distribution”, Physical Review Letters
95.1, 2005
[32] Acin A, Gisin N, Masanes L,“From Bell’s Theorem to Secure Quantum Key Distribution”, Physical
Review Letters 97.12, 2006
[33] Brassard Gilles, Norbert Lütkenhaus, Tal Mor and Barry C. Sanders, “Security aspects of practical
quantum cryptography”, Advances in Cryptology—EUROCRYPT 2000, Springer Berlin Heidelberg,
2000, pp. 289-299
[34] Mayers Dominic, “Unconditional security in quantum cryptography”, Journal of the ACM
(JACM), 48, no. 3, 2001, pp. 351-406
[35] Damian Pitalua-Garcia, “Quantum Information, Bell Inequalities and the No-Signalling Principle,”
Ph.D. dissertation, Gonville and Caius College, University of Cambridge, September 2013
Authors
Minal Lopes received B.E. and M.E. degrees in Electronics Engineering from Mumbai
University. She is working as an Assistant Professor at St. Francis Institute of
Technology Mumbai, Ind ia. Currently, she is pursuing PhD under guidance of Dr.
Nisha Sarwade at the VJTI, Mumbai, India. Her areas of specialization are Quantum
cryptography, Data and Network security and Next generation Networks.
Dr. Nisha Sarwade received B.E. degree in Electronics Engineering from Jiwaji
University, Gwalior and M.E. (Solid State Electronics) and PhD (Electronic
Engineering) from University of Roorkee. She was working as a lecturer at the
Universit y of Roorkee during 1983-1987. Currently she is working as an Associate
Professor at the VJTI, Mumbai, India. Her research interests include Nano Electronics
with emphasis on CNT, Compound semiconductors, High-k dielectrics and flash
memories and Microwave circuit design. She has 56 national as well as international
publications to her credit.

More Related Content

What's hot (18)

PDF
Quantum cryptography for secured communication networks
IJECEIAES
 
PDF
5215ijcis01
ijcisjournal
 
PDF
Seminar Report on Quantum Key Distribution
Shahrikh Khan
 
PDF
IRJET- Quantum Key Distribution
IRJET Journal
 
PDF
Authentication in Different Scenarios
Raj Sikarwar
 
PDF
Quantum Key Distribution (QKD) and Commodity Security Protocols: Introduction...
IJNSA Journal
 
PDF
Quantum Key Distribution
Shahrikh Khan
 
PDF
Authentication in Different Scenarios
Raj Sikarwar
 
PPTX
Quantum Cryptography presentation
Kalluri Madhuri
 
PDF
The security of quantum cryptography
wtyru1989
 
PPT
Quantum cryptography
Sukhdeep Kaur
 
PDF
A Modified Pair Wise Key Distribution Schemes and There Effect On Network Per...
IJERA Editor
 
PDF
GROUP SESSION KEY EXCHANGE MULTILAYER PERCEPTRON BASED SIMULATED ANNEALING GU...
ijwmn
 
PDF
VERIFICATION OF QUANTUM CRYPTOGRAPHY PROTOCOLS BY MODEL CHECKING1010ijnsa04
IJNSA Journal
 
PDF
Elgamal signature for content distribution with network coding
ijwmn
 
PPT
Quantum cryptography a modern cryptographic security
Kamal Diwakar
 
PPTX
quantumcrypto
tabrej
 
Quantum cryptography for secured communication networks
IJECEIAES
 
5215ijcis01
ijcisjournal
 
Seminar Report on Quantum Key Distribution
Shahrikh Khan
 
IRJET- Quantum Key Distribution
IRJET Journal
 
Authentication in Different Scenarios
Raj Sikarwar
 
Quantum Key Distribution (QKD) and Commodity Security Protocols: Introduction...
IJNSA Journal
 
Quantum Key Distribution
Shahrikh Khan
 
Authentication in Different Scenarios
Raj Sikarwar
 
Quantum Cryptography presentation
Kalluri Madhuri
 
The security of quantum cryptography
wtyru1989
 
Quantum cryptography
Sukhdeep Kaur
 
A Modified Pair Wise Key Distribution Schemes and There Effect On Network Per...
IJERA Editor
 
GROUP SESSION KEY EXCHANGE MULTILAYER PERCEPTRON BASED SIMULATED ANNEALING GU...
ijwmn
 
VERIFICATION OF QUANTUM CRYPTOGRAPHY PROTOCOLS BY MODEL CHECKING1010ijnsa04
IJNSA Journal
 
Elgamal signature for content distribution with network coding
ijwmn
 
Quantum cryptography a modern cryptographic security
Kamal Diwakar
 
quantumcrypto
tabrej
 

Viewers also liked (18)

PDF
DEVELOPMENT OF SECURE CLOUD TRANSMISSION PROTOCOL (SCTP) ENGINEERING PHASES :...
ijcisjournal
 
PDF
A New Method for Preserving Privacy in Data Publishing Against Attribute and ...
ijcisjournal
 
PDF
Copy Move Forgery Detection Using GLCM Based Statistical Features
ijcisjournal
 
PDF
Fault Detection in Mobile Communication Networks Using Data Mining Techniques...
ijcisjournal
 
PDF
High Capacity Image Steganography Using Adjunctive Numerical Representations ...
ijcisjournal
 
PDF
Hardware Implementation of Algorithm for Cryptanalysis
ijcisjournal
 
PDF
Blind Image Quality Assessment with Local Contrast Features
ijcisjournal
 
PDF
A 130-NM CMOS 400 MHZ 8-Bit Low Power Binary Weighted Current Steering DAC
ijcisjournal
 
PDF
Wavelet Based on the Finding of Hard and Soft Faults in Analog and Digital Si...
ijcisjournal
 
PDF
To the networks rfwkidea32 16, 32-8, 32-4, 32-2 and rfwkidea32-1, based on th...
ijcisjournal
 
PDF
Penetration testing in agile software
ijcisjournal
 
PDF
An efficient algorithm for sequence generation in data mining
ijcisjournal
 
PDF
Gait Based Person Recognition Using Partial Least Squares Selection Scheme
ijcisjournal
 
PDF
SECURITY ANALYSIS OF THE MULTI-PHOTON THREE-STAGE QUANTUM KEY DISTRIBUTION
ijcisjournal
 
PDF
Performance Analsis of Clipping Technique for Papr Reduction of MB-OFDM UWB S...
ijcisjournal
 
PDF
An Optimized Approach for Fake Currency Detection Using Discrete Wavelet Tran...
ijcisjournal
 
PDF
DWT Based Audio Watermarking Schemes : A Comparative Study
ijcisjournal
 
PDF
General Kalman Filter & Speech Enhancement for Speaker Identification
ijcisjournal
 
DEVELOPMENT OF SECURE CLOUD TRANSMISSION PROTOCOL (SCTP) ENGINEERING PHASES :...
ijcisjournal
 
A New Method for Preserving Privacy in Data Publishing Against Attribute and ...
ijcisjournal
 
Copy Move Forgery Detection Using GLCM Based Statistical Features
ijcisjournal
 
Fault Detection in Mobile Communication Networks Using Data Mining Techniques...
ijcisjournal
 
High Capacity Image Steganography Using Adjunctive Numerical Representations ...
ijcisjournal
 
Hardware Implementation of Algorithm for Cryptanalysis
ijcisjournal
 
Blind Image Quality Assessment with Local Contrast Features
ijcisjournal
 
A 130-NM CMOS 400 MHZ 8-Bit Low Power Binary Weighted Current Steering DAC
ijcisjournal
 
Wavelet Based on the Finding of Hard and Soft Faults in Analog and Digital Si...
ijcisjournal
 
To the networks rfwkidea32 16, 32-8, 32-4, 32-2 and rfwkidea32-1, based on th...
ijcisjournal
 
Penetration testing in agile software
ijcisjournal
 
An efficient algorithm for sequence generation in data mining
ijcisjournal
 
Gait Based Person Recognition Using Partial Least Squares Selection Scheme
ijcisjournal
 
SECURITY ANALYSIS OF THE MULTI-PHOTON THREE-STAGE QUANTUM KEY DISTRIBUTION
ijcisjournal
 
Performance Analsis of Clipping Technique for Papr Reduction of MB-OFDM UWB S...
ijcisjournal
 
An Optimized Approach for Fake Currency Detection Using Discrete Wavelet Tran...
ijcisjournal
 
DWT Based Audio Watermarking Schemes : A Comparative Study
ijcisjournal
 
General Kalman Filter & Speech Enhancement for Speaker Identification
ijcisjournal
 
Ad

Similar to Cryptography from quantum mechanical (20)

PDF
Comprehensive Study of BB84, A Quantum Key Distribution Protocol
IRJET Journal
 
PDF
Report_amit
Amit Kumar Mohapatra
 
PPT
crypto.ppt
YousafAli83
 
PPT
crypto ppt, Seminar Report on Crypto graphy
prafulljha10
 
PPT
crypto.ppt
Sourabh97054
 
PDF
B03250609
theijes
 
PDF
quantumcryptography-180425230158.pdf
sasasas14
 
PPTX
Quantum Key Distribution Meetup Slides
Kirby Linvill
 
PPTX
Quantum Key Distribution Meetup Slides (Updated)
Kirby Linvill
 
PPTX
Quantum cryptography
Sreekanth Narendran
 
PDF
BB84 with Both Several Cloning and Intercept-resend Attacks
IJECEIAES
 
PDF
ANALYSIS OF THE SECURITY OF BB84 BY MODEL CHECKING
IJNSA Journal
 
PPTX
Cryptopresentationfinal
skadyan1
 
PDF
INTEGRATING IDENTITY-BASED CRYPTOGRAPHY IN IMS SERVICE AUTHENTICATION
IJNSA Journal
 
PDF
QUANTUM THREE-PASS PROTOCOL: KEY DISTRIBUTION USING QUANTUM SUPERPOSITION STATES
IJNSA Journal
 
PPTX
Quantum crypto system
gayatri thakur
 
PPTX
Quantum Cryptography & Key Distribution.pptx
Daniel938043
 
PDF
Quantum Cryptography - Seminar report
Shyam Mohan
 
PPT
Quantum crypto
ganeshkarthick
 
ODP
Quantum Cryptography - Quantum Coin Tossing
Ruwan Ranganath
 
Comprehensive Study of BB84, A Quantum Key Distribution Protocol
IRJET Journal
 
crypto.ppt
YousafAli83
 
crypto ppt, Seminar Report on Crypto graphy
prafulljha10
 
crypto.ppt
Sourabh97054
 
B03250609
theijes
 
quantumcryptography-180425230158.pdf
sasasas14
 
Quantum Key Distribution Meetup Slides
Kirby Linvill
 
Quantum Key Distribution Meetup Slides (Updated)
Kirby Linvill
 
Quantum cryptography
Sreekanth Narendran
 
BB84 with Both Several Cloning and Intercept-resend Attacks
IJECEIAES
 
ANALYSIS OF THE SECURITY OF BB84 BY MODEL CHECKING
IJNSA Journal
 
Cryptopresentationfinal
skadyan1
 
INTEGRATING IDENTITY-BASED CRYPTOGRAPHY IN IMS SERVICE AUTHENTICATION
IJNSA Journal
 
QUANTUM THREE-PASS PROTOCOL: KEY DISTRIBUTION USING QUANTUM SUPERPOSITION STATES
IJNSA Journal
 
Quantum crypto system
gayatri thakur
 
Quantum Cryptography & Key Distribution.pptx
Daniel938043
 
Quantum Cryptography - Seminar report
Shyam Mohan
 
Quantum crypto
ganeshkarthick
 
Quantum Cryptography - Quantum Coin Tossing
Ruwan Ranganath
 
Ad

Recently uploaded (20)

PDF
Jak MŚP w Europie Środkowo-Wschodniej odnajdują się w świecie AI
dominikamizerska1
 
PDF
Human-centred design in online workplace learning and relationship to engagem...
Tracy Tang
 
PPTX
UiPath Academic Alliance Educator Panels: Session 2 - Business Analyst Content
DianaGray10
 
PPTX
Building a Production-Ready Barts Health Secure Data Environment Tooling, Acc...
Barts Health
 
PDF
Building Real-Time Digital Twins with IBM Maximo & ArcGIS Indoors
Safe Software
 
PDF
Complete JavaScript Notes: From Basics to Advanced Concepts.pdf
haydendavispro
 
PDF
NewMind AI Journal - Weekly Chronicles - July'25 Week II
NewMind AI
 
PDF
DevBcn - Building 10x Organizations Using Modern Productivity Metrics
Justin Reock
 
PDF
NewMind AI - Journal 100 Insights After The 100th Issue
NewMind AI
 
PDF
Empower Inclusion Through Accessible Java Applications
Ana-Maria Mihalceanu
 
PDF
Impact of IEEE Computer Society in Advancing Emerging Technologies including ...
Hironori Washizaki
 
PPTX
MSP360 Backup Scheduling and Retention Best Practices.pptx
MSP360
 
PDF
July Patch Tuesday
Ivanti
 
PDF
Predicting the unpredictable: re-engineering recommendation algorithms for fr...
Speck&Tech
 
PDF
Achieving Consistent and Reliable AI Code Generation - Medusa AI
medusaaico
 
PDF
Exolore The Essential AI Tools in 2025.pdf
Srinivasan M
 
PDF
Fl Studio 24.2.2 Build 4597 Crack for Windows Free Download 2025
faizk77g
 
PDF
Blockchain Transactions Explained For Everyone
CIFDAQ
 
PDF
Persuasive AI: risks and opportunities in the age of digital debate
Speck&Tech
 
PPTX
Top iOS App Development Company in the USA for Innovative Apps
SynapseIndia
 
Jak MŚP w Europie Środkowo-Wschodniej odnajdują się w świecie AI
dominikamizerska1
 
Human-centred design in online workplace learning and relationship to engagem...
Tracy Tang
 
UiPath Academic Alliance Educator Panels: Session 2 - Business Analyst Content
DianaGray10
 
Building a Production-Ready Barts Health Secure Data Environment Tooling, Acc...
Barts Health
 
Building Real-Time Digital Twins with IBM Maximo & ArcGIS Indoors
Safe Software
 
Complete JavaScript Notes: From Basics to Advanced Concepts.pdf
haydendavispro
 
NewMind AI Journal - Weekly Chronicles - July'25 Week II
NewMind AI
 
DevBcn - Building 10x Organizations Using Modern Productivity Metrics
Justin Reock
 
NewMind AI - Journal 100 Insights After The 100th Issue
NewMind AI
 
Empower Inclusion Through Accessible Java Applications
Ana-Maria Mihalceanu
 
Impact of IEEE Computer Society in Advancing Emerging Technologies including ...
Hironori Washizaki
 
MSP360 Backup Scheduling and Retention Best Practices.pptx
MSP360
 
July Patch Tuesday
Ivanti
 
Predicting the unpredictable: re-engineering recommendation algorithms for fr...
Speck&Tech
 
Achieving Consistent and Reliable AI Code Generation - Medusa AI
medusaaico
 
Exolore The Essential AI Tools in 2025.pdf
Srinivasan M
 
Fl Studio 24.2.2 Build 4597 Crack for Windows Free Download 2025
faizk77g
 
Blockchain Transactions Explained For Everyone
CIFDAQ
 
Persuasive AI: risks and opportunities in the age of digital debate
Speck&Tech
 
Top iOS App Development Company in the USA for Innovative Apps
SynapseIndia
 

Cryptography from quantum mechanical

  • 1. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 DOI:10.5121/ijcis.2014.4202 13 CRYPTOGRAPHY FROM QUANTUM MECHANICAL VIEWPOINT Minal Lopes1 and Dr. Nisha Sarwade2 1 Department of Electrical Engineering, VJTI, Mumbai, India 2 Department of Electrical Engineering, VJTI, Mumbai, India ABSTRACT Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed the security through encryption of their data, with the help of a common key. Both the parties should agree on this key prior to communication. The cryptographic systems which perform these tasks are designed to keep the key secret while assuming that the algorithm used for encryption and decryption is public. Thus key exchange is a very sensitive issue. In modern cryptographic algorithms this security is based on the mathematical complexity of the algorithm. But quantum computation is expected to revolutionize computing paradigm in near future. This presents a challenge amongst the researchers to develop new cryptographic techniques that can survive the quantum computing era. This paper reviews the radical use of quantum mechanics for cryptography. KEYWORDS Quantum cryptography (QC), Quantum key Distribution (QKD), Quantum Mechanics, Bell’s Theorem 1. INTRODUCTION In 1984, Bennett (from IBM Research) and Brassard (from University of de Montreal) presented an idea of using quantum mechanics for cryptography (Quantum Cryptography). They proposed an algorithm (BB84) based on Heisenberg’s ‘uncertainty principle’ for exchanging the key (QKD) along with a classical one-time pad (OTP) for information exchange [1]. After BB84, almost a decade later in 1991, Ekert reconsidered QC but with another unique principle of quantum mechanics known as ‘Quantum Entanglement’ [2]. Since these two base papers, many researchers have contributed towards QC protocols. All these protocols can be briefly divided in two categories, protocols based on ‘Uncertainty principle’ and based on ‘quantum Entanglement’ [3]. Though there is ample contribution towards development of protocols, the practical implementation of these protocols rather faces much more complications which make QC vulnerable. The Photon number splitting (PNS) attacks [4], a side channel attack [5], and imperfections in detectors [6] shows that QKD device imperfections need to be addressed. This gives rise to new category of protocols known as Device Independent (DI) QKD and Measurement Device Independent (MDI) QKD protocols. The focus of this paper is on basic understanding of Quantum Cryptography and the underlying quantum principles while traversing along the roadmap of major QC protocol design evolution. The organization of this paper is as follows: In section II, we will discuss fundamentals of QKD and basic protocols based on Heisenberg’s uncertainty principle. Section III will brief on
  • 2. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 14 evolutionary protocols based on Bell’s theorem and quantum entanglement. In Section IV we will discuss the need for advanced protocol design and its approach using the principle of non locality and no signalling principle. We will also discuss the modern secure QKD protocol design through an example. 2. BASIC QKD PROTOCOLS 2.1. Fundamentals of QKD The basic model of QKD protocol is shown in fig.1. It includes two classical users Alice and Bob, connected through quantum and classical communication channel, wishing to communicate securely. The quantum channel is used to exchange the key, whereas classical channel is used for actual information transfer. Figure 1. Basic QKD Model Figure shows Eve as a malicious eavesdropper, who have access to both the channels and is assumed to have infinite resources. Having this model established let us discuss the general steps involved in any QKD protocol. A typical QKD protocol comprises eight stages [7]: 1. Random number generation by Alice(Sender) 2. Quantum communication 3. Sifting (basis reconciliation) 4. Reconciliation 5. Estimation of Eve’s partial information gain 6. Privacy amplification 7. Authentication of public messages 8. Key confirmation. First, Alice (the sender) generates a sequence of random numbers from a hardware or software random number generator. Then, using the specified QKD protocol she encodes these random bits into the quantum states of a sequence of signals from her quantum light source and sends them over a “quantum channel” to Bob (the receiver). Bob applies a quantum measurement to each received signal and assigns it a bit value. Next, Bob informs Alice over a classical channel, in which time slots he detected photons, but without revealing the bit value he assigned to each one. The bit strings corresponding to the signals detected by Bob are known as raw keys. Then, Alice and Bob select by public discussion a Quantum channel Classical channel Alice Eve Bob
  • 3. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 15 random portion of their raw keys, known as sifted keys. In an ideal system Alice and Bob’s sifted key bits would be perfectly correlated. In practice, Bob’s sifted key is not perfectly correlated with Alice’s. It contains transmission errors arising from background photons, detector noise and polarization imperfections. A typical error rate of 1 to 5 percent is presented by various literatures [8]-[10]. These errors must be located and corrected. Bob reconciles his sifted key with Alice’s using an error correction method over their public channel, during which parity information about the sifted key is leaked. Their perfectly correlated reconciled keys are only partially secret now. From the number of errors that Alice and Bob find in Bob’s sifted key they are able to estimate an upper bound on any partial information that Eve might have been able to obtain on Alice’s transmitted bit string. Quantum mechanics ensures that Eve’s measurements would introduce a disturbance (errors) into Bob’s sifted key that would be strongly correlated with Eve’s partial information gain from them. Alice and Bob extract from their reconciled keys a shorter, final bit string on which Eve’s expected information is much less than one bit after an information-theoretic procedure known as “privacy amplification”. In this procedure they use further public communications to agree to hash their reconciled keys into shorter final secret keys. For example, if Alice and Bob have 6 reconciled bits and their bound on Eve’s information tells them that at most she knows 3 of these bits, they can agree to form two secret bits by XORing together the first 4 bits and the final 4 bits. Eve would have to guess at least one of the bits being XORed in each case and so would be ignorant of the outcome. These two bits are therefore suitable for use in a cryptographic key. More generally, Alice and Bob can form their final secret bits from the parities of random subsets of their reconciled bits [11]. 2.2. The BB84 Protocol BB84 is based on ‘uncertainty principle’ which states that unlike digital data the quantum data cannot be copied or measured without disturbing it. This immediately intimates that the eavesdropper cannot gain even a partial data without altering it. Also these alterations are most likely to be detected, solving the root cause problem of cryptography, known as ‘eavesdropping’. This gives a radically different foundation for cryptography. In BB84, Alice generates a sequence of random numbers and encodes them using basis shown in Fig. 2. She chooses this basis randomly and transmits the polarized photon to Bob.
  • 4. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 16 Figure 2. BB84 Encoding Bob now measures the polarization of each received bit by choosing a random basis per bit. Now according to theory of probability, Alice and Bob are expected to choose same basis for more than 50% of cases on an average. Thus in an ideal case, with no eavesdropping and no transmission errors, the quantum bit error rate (QBER) of the transmission will be less than 50%. But Eve’s presence will increase the QBER to more than 75% (ideally). This is illustrated in TABLE I and II through an example. Table 1. Working of BB84 protocol without eavesdropping 0°, binary 0 45°, binary 0 90°, binary 1 135°, binary 1 Rectilinear Basis Diagonal Basis Photon Polarization
  • 5. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 17 From table I, it is clear that the QBER is less than 50% (13/29*100=44.82%, considering transmission errors), which is acceptable. Thus Alice and Bob can decide to continue the communication. In such case the sifted keys of both the parties will be partially correlated due to transmission errors. These errors can easily be removed by reconciliation process of ‘parity check’. Table II depicts the case of presence of eavesdropper and transmission errors. Here the QBER is very high (24/29 *100 = 82.75% which is > 50%). This indicates the presence of eavesdropping in the communication. Both the parties can abort the transmission now. BB84 have used quantum properties is such an efficient manner, that it has become the base for quantum cryptography. The disadvantage of BB84 is its assumptions for ideal quantum sources and detectors, which makes it vulnerable to PNS and detector noise attacks. Many other variants of it exist including B92 [12] using only two orthogonal states, SSP99 [13] using six states on three orthogonal bases. This means that an eavesdropper would have to choose the right basis from among 3 possibilities. This extra choice causes the eavesdropper to produce a higher rate of error thus becoming easier to detect. Table 2. Working of BB84 protocol with eavesdropping and Transmission Errors W - Wrong, C - Correct
  • 6. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 18 While there are number of other BB84 variants, one of particular interest was proposed in 2004 by Scarani, Acin, Ribordy, and Gisin named SARG04 [14] due to its capability of detecting the photon number splitting attack. 2.3. The SARG04 Protocol This protocol is a modification of BB84 in sifting process. The bases used are non orthogonal states as shown in Fig (3), which cannot be discriminated deterministically. Also instead of revealing the bases, Alice announces the random states that she has used in preparing her photons. These random non orthogonal states can be defined as, { } { } )(,,with,, '' , ' IwwzwwxA ww −+∈= Where, x± code for 0 and z± code for 1 a1 a0 b0 b1 Figure 3. Two pairs of Non-orthogonal states in SARG04 The protocol is explained through an example in table III. Now when Alice sends these states, Bob will again measure the standard deviation against each polarization in that state. In any of the states if he gets the negative result, it indicates that Alice certainly has send the opposite state. SARG04 has sifted key rate of 25% as compared to 50% for BB84. But it increases the attenuation for pulses with one and two photons, thus indicating the presence of eavesdropping in case of weak coherent pulses. This makes it robust against PNS attack. For definiteness, in Table 3 for bit 8, Alice announces the state as A-,-. When Bob measures his photon in both the polarizations, he gets negative result for one of the states ( ), indicating that Alice has send an opposite state ( ). SARG04 has ‘sifted key’ rate of 25% as compared to 50% for BB84. But the attenuation increases specifically for pulses with one and two photons, thus indicating the presence of eavesdropping in case of weak coherent pulses. This makes it robust against PNS attack. Basis ‘a’ Basis ‘b’
  • 7. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 19 Table 3. Working of SARG04 protocol 3. PROTOCOLS BASED ON QUANTUM ENTANGLEMENT (BELL’S THEOREM) Entanglement is one of the most puzzling phenomena in quantum mechanics. It states that, if two particles are entangled, measuring the properties of one particle instantly determines the state of the second, no matter how far apart the two are [15]. Literature reveals possibilities of generating the pairs of such entangled photons [16-17], where each photon will always have a polarization orthogonal to the other photon. Also this polarization is indeterminate until a measurement is made. At the instant the measurement is made the polarization of the second photon becomes orthogonal to that of the first. Ekert in his seminal paper [2] used this phenomenon for quantum cryptography by considering an un-trusted source of entangled photons between Alice and Bob. He claimed that there is no information carried by photons during transit, thus no eavesdropping. But if eavesdropper injects extra quanta (photon) in the communication, he suggested its detection by testing the Bell’s Inequality at either ends. 3.1 Bell’s Theorem and CHSH Inequality Ekert’s pioneering paper [2] used Bell’s theorem for the first time to detect the eavesdropping. Although Bell’s theorem was derived in view of EPR paradox for detection of local hidden variables, Ekert suggested its use to detect the presence of eve in the quantum communication. Bell’s theorem states that, “There exist predictions of quantum mechanics that are inconsistent with the predictions of local hidden variable theories [LHVT]”. Bell [18] provided a mathematical description for local hidden variable theories, which are hypothetical physical theories, based on the EPR assumptions of local causality and physical reality. Bell's formalism allows us to test these conditions experimentally by violating some inequalities (Bell inequalities), which are satisfied by LHVT. Although there are various experiments proposed for testing Bell’s Inequality, the most popular one is the CHSH inequality [19].
  • 8. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 20 The simplified form of a CHSH inequality is, 2 )( ),(),(),(),( '''' ≤ −++= S IIand baEbaEbaEbaES Where, a and ' a are the detector settings on side A, b and ' b are the detector settings on side B. The four combinations of these settings are tested in separate sub-experiments. The terms ),( baE etc. are the quantum correlations defined as the expectation value of the product of the outcomes of the experiment. The mathematical formalism of quantum mechanics predicts a maximum value for ‘S’ as 22 , which is greater than 2, and CHSH violations are therefore predicted if the correlations are purely quantum. This property is utilized to check if Eve malfunctions with the quantum transmission. In 1992, Bennett, Brassard and Mermin [20] proved that E91 is the entanglement version of BB84 and any variant of BB84 could be adapted to use an entangled photon source instead of Alice being the source. Enzer et al [21] have described an entangled version of the SSP protocol with added security. The entanglement version of SARG04 was proposed by Fung et. al.[22]. Let us discuss the E91 protocol as a classical example of Entanglement based protocols. 3.2 E91 Protocol Assuming a source (EPR) that emits pairs of spin-1/2 particles, in a singlet state, first Alice and Bob distribute n pairs of qubits in a Bell states represented as, ( ) )(0110 2 1 IIIBABA +=+  Equation (III) represents entangled state particles (The bell states can be represented in four different combinations of two qubits [23]) that fly apart towards Alice and Bob and can be prepared to have spin components along one of the three directions (x, y, z) given by unit vectors ia and )3,2,1,( =jibj having angles,  2 1 , 4 1 ,0 321 === aaa and  4 3 , 2 1 , 4 1 321 === bbb , as shown in fig. 4. The subscripts “a” and “b” refer to Alice and Bob respectively. Figure 4. E91’s basis used by Alice and Bob in normal phase [24] For each instance ni ,......3,2,1= , each user randomly and independently chooses the basis (analyzer’s orientation) to perform the measurements. Later only those cases where Alice and Bob’s measurements match are used, while others are discarded. Among the matched cases, Alice Alice Bob EPR
  • 9. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 21 and Bob agree on some results to be used for checking phase while remaining cases being used for normal phase. In normal phase, each user performs )(zS measurements. The outcomes of these measurements are perfectly correlated and thus used as a key later. In the checking phase, each user performs the measurements for Bell’s inequality violation of the state by using only two basis as shown in fig. 5. Alice (Bob) randomly and independently chooses one between the two directions a and a′ (b and b′) for measurements. Then Alice (Bob) performs spin-measurements in the chosen direction. Spin-measurement in direction p (q) is denoted as S(p) (S(q)) where p = a, a′ (q = b, b′). The probability that Alice gets a result ±1 in spin-measurement S(p) and Bob gets a result ±1 in spin-measurement S(q) is denoted as ),( qpP ±± . The correlation function ),( qpE is given by )(),(),(),(),(),( IVqpPqpPqpPqpPqpE +−−+−−++ −−+= Figure 5. E91’s basis for testing Bell’s inequality violation and the Bell’s inequality is given by [25] (refer equation II) )(2),(),(),(),( '''' VbaEbaEbaEbaE ≤−++ If the particles are perfectly entangled then this inequality will produce the value of 22 , which is greater than 2, violating the inequality. If Eve provides separable states (non entangled) to Alice and Bob she will get detected in checking phase. If she provides perfectly entangled states, she may pass the checking phase but will not have any information about the key. Thus E91 shows the practical application of Bell’s theorem in cryptography, which can test the safety of the key distribution. 4. NEXT GENERATION QKD All though it is claimed [26-27] that the security of QC depends on the fundamental laws of quantum physics, the working of QC protocols is based on certain assumptions. Perfect device design (quantum sources and detectors), secure environment (physical location of legitimate parties) are some of them. Such assumptions leave QC vulnerable. As discussed earlier, the PNS attack exploits the replacement of single photon sources by weak coherent pulses source. The E91 assumes the detector efficiency, which if not 100% can be exploited to produce detection loopholes. The dark count rate of detectors further leads to reduced detection efficiency which is analogous to the losses in the quantum channel. The solution over all these limitations is the motivation for next generation QKD protocols known as Device- Independent QKD (DIQKD) protocols. The idea of device independency was EPR Alice Bob
  • 10. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 22 originally derived through E91 protocol, where the source is considered untrusted and violation of Bell’s inequality serves to decide the security of protocol. But it is proved that the violation of Bell’s inequality can be faked by using classical light [28] and utilizing the detection loophole in single photon detector [29]. Thus E91 is one step away from the actual DIQKD purpose. To achieve total device independence Alice and Bob should not only distrust the source, but should also assume that their measuring apparatuses are untrusted and controlled by Eve. We thus can define following set of assumptions as the ultimate aim of fully DIQKD protocols [30]. 1. Alice and Bob’s physical locations are secure. 2. They have trusted random number generators. 3. They have trusted classical devices to store and process the classical data. 4. They share an open authenticated classical channel. 5. Quantum physics is correct. The pioneering papers for DIQKD were proposed by Barrett et.al. (BHK05) [31] and Acin et.al. (AGM06)[32]. Till BHK05, the existing security proofs of QC [33-34] were based on the no- cloning theorem. 4.1 The No-cloning Theorem The no-cloning theorem states that “it is impossible to produce a perfect copy of an unknown quantum state with any nonzero success probability”. BHK05 for the first time used quantum non locality and no-signalling principle for proving the security of QC. 4.2 Quantum Non-locality It states that there exist some correlations that are non local and also follows the relativistic principle of causality. The popular example of such non local correlation is quantum Entanglement. 4.3 No-signalling Principle The no-signalling principle states that communication between two distant parties cannot be performed without the transmission of any physical systems, despite any physical resources that the parties may share. It can be shown that the quantum entanglement is consistent with relativity by satisfaction of the no-signalling principle [35]. Thus if an eavesdropper is limited by no-signalling principle, means he cannot prepare two or more physical systems in a joint state such that a local measurement on one system may transfer information to another distinct system, it is possible to develop fully device independent QKD protocols. It was noted later that the physical implementation of BHK05 was not possible because of its stringent requirements about Alice and Bob’s noise free channel. Also this protocol generates a single shared secret bit by making many uses of the channel reducing the key rate to inefficient value. The AGM06 was considered more practical DIQKD protocol.
  • 11. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 23 4.4 The AGM06 Protocol AGM06 is the modified E91 protocol as it uses Bell’s inequality for proving the security. The strength of AGM06 is that it imparts no assumption on quantum devices (aiming towards fully device independence) and its security depends only on prerequisite fundamental assumptions discussed above. As compared to E91, AGM06 expects Alice and Bob to share a quantum channel consisting of a source that emits pairs of photons in an entangled state. Alice chooses one out of three possible measurements )2,1,0( =xAx to perform on her photon, while Bob chooses one out of two measurements )2,1( =yBy . The output of all measurements is the binary bits { }1,1, −+∈ba . The raw key is then extracted from outcomes of the measurement pair { }1,0 BA . The quantum bit error rate is defined as )1,0|( ==≠= yxbaPQ . ‘Q’ estimates the number of correlations between Alice and Bob’s symbols, and thus quantifies the amount of classical communications needed for error correction. The measurements 2121 and,, BBAA are used to estimate security by using the CHSH polynomial (refer equation (II)) as given below, )()2,2|()1,2|()2,1|()1,1|( VIyxbaPyxbaPyxbaPyxbaPS ==≠−===+===+===≤ The violation of Equation (VI) implies that in three measurement choices, Alice and Bob are correlated, while in the fourth case they are anticorrelated. Here S > 2 is expected to ensure the security. 5. CONCLUSION Quantum Cryptography provides a promising future in the field of data and network security through the fundamental quantum mechanical principles. This paper has presented a review of foundational QC protocols along with the modern quantum principles that aids cryptography. It is found that most protocols are based on BB84 and E91 and are vulnerable when implemented with realistic physical devices. It is also intimated that possibility of fully equipped and post quantum eavesdropper, puts strong limitations on feasibility of QC. Thus QC needs additional efforts and contribution from researchers in development of protocols and testing their security. With the development in quantum communication, this field finds tremendous scope in near future. Therefore the implementation feasibility of QC without any assumptions needs to be tested. The new generation protocols like DIQKD are proved secure theoretically but lack the physical implementation. QC has still a long way to go in terms of mathematical modeling. The performance metrics like key rate, quantum bit error rate needs to be exploited first through mathematical and then physical modelling. Quantum cryptography thus seems very fascinating field of research which needs collaborative efforts from diverse fields like physics, optics, computer science and mathematics. It alongside demands the development of various other fields like single photon sources, free space optical communication, optical detectors which in future will also be able to provide compatibility to the post quantum cryptographic research.
  • 12. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 24 REFERENCES [1] Bennett, C. H. and Brassard, G., "Quantum Cryptography: Public key distribution and coin tossing.", International Conference on Computers, Systems & Signal Processing, Bangalore, India, 10-12 December 1984, pp. 175-179. [2] Ekert, A. K., "Quantum cryptography based on Bell's theorem", Physical Review Letters, vol. 67, no. 6, 5 August 1991, pp. 661 - 663. [3] Mart Haitjema, “A Survey of the Prominent Quantum Key Distribution Protocols”, online Available at http://www.cse.wustl.edu/~jain/cse571-07/ftp/quantum/ [4] G Brassard, N Lütkenhaus, T Mor, BC Sanders, “Limitations on practical quantum cryptography”, Physical Review Letters, vol.6, 1985, pp.1330-1333. [5] Ilja Gerhardt, Qin Liu, Antia Lamas-Linares, Johannes Skaar, Christian Kurtsiefer, Vadim Makarov, “Full-field implementation of a perfect eavesdropper on a quantum cryptography system”, Nature communications, 2011 [6] Chi-Hang Fred Fung, Bing Qi, Kiyoshi Tamaki, Hoi-Kwong Lo, “Phase-remapping attack in practical quantum-key-distribution systems”, Physical Review A, vol. 75, March 2007, 032314. [7] Lütkenhaus N., “Estimates for practical quantum cryptography,” Physical Review A, Vol. 59, Jan 1999, pp 3301–3319. [8] C. Marand, and P. D. Townsend, “Quantum key distribution over distances as long as 30 km,” Optics Letter, Vol. 20, Issue 16, 1995, pp 1695–1697 [9] Franson, J. D., and Ilves, H., “Quantum Cryptography Using Polarization Feedback,” Journal of Modern Optics, vol. 41,1994, pp. 2391–2396 [10] H. Zbinden, N. Gisin, B. Huttner, A. Muller, “Practical Aspects of Quantum Cryptographic Key Distribution”, Journal of Cryptology, vol. 11,1998, pp 1–14 [11] Charles H. Bennett, Gilles Brassard, Claude Crkpeau, and Ueli M. Maurer, “Generalized Privacy Amplification”, IEEE Transactions on Information theory, Vol. 41, No.6, nov 1995 [12] Bennett C., "Quantum cryptography using any two non-orthogonal states", Physics Review Letter, vol. 68, 1992, pp. 3121-3124. [13] Bechmann Pasquinucci H., and Gisin, N., "Incoherent and coherent eavesdropping in the six-state protocol of quantum cryptography." Physics Review letter A, vol.59, 1999, pp.4238-4248. [14] Scarani A., Acin A., Ribordy G., Gisin N., "Quantum cryptography protocols robust against photon number splitting attacks.", Physical Review Letters, vol. 92, 2004. [15] Jeff Hecht, “Photonics Frontiers: Entangled photons: ‘spooky action, works at a distance”, online, Available at http://www.laserfocusworld.com/articles/print/volume-41/issue-12/features/photonics- frontiers-entangled-photons-lsquospooky-actionrsquo-works-at-a-distance.html [16] M Reck, P G Kwiat, “Iconic images: Entangled Photons”, online available at, http://www.ipod.org.uk/reality/reality_entangled_photons.asp [17] Altepeter J., E. Jeffrey, P. Kwiat. "Phase-compensated ultra-bright source of entangled photons", Optics Express 13.22, pp. 8951-8959, 2005 [18] Bell John Stuart, “On the Einstein-Podolsky-Rosen Paradox”, Physics 1, 195–200, 1964 [19] Clauser, John F., Michael A. Horne, Abner Shimony, Richard A. Holt, “Proposed experiment to test local hidden-variable theories”, Physical review letters 23, 1969, pp 880-884 [20] Bennet C. H., Brassard G., Mermin, N. D., “Quantum cryptography without Bell's theorem”, Phys. Rev. Lett. 68, 1992, pp. 557-559 [21] Enzer D., Hadley P., Gughes R., Peterson C., Kwiat P., “Entangled-photon six-state quantum cryptography”, New Journal of Physics, 2002, pp 45.1-45.8 [22] Fung C., Tamaki K., Lo H., “On the performance of two protocols: SARG04 and BB84”, Phys. Rev., A 73, 012337, 2006 [23] Nielsen, Michael A, Chuang, Isaac L, “Quantum computation and quantum information”, Cambridge University Press, 2000, pp. 25 [24] Nicolas Gisin, Grégoire Ribordy, Wolfgang Tittel, Hugo Zbinden, “Quantum cryptography”, Rev. Mod. Phys. 74, 145, March 2002 [25] Hwang Won-Young, “Bell’s inequality, random sequence, and quantum key distribution”, Physical Review A 71.5, 2005 [26] Scarani Valerio, Helle Bechmann-Pasquinucci, Nicolas J. Cerf, Miloslav Dusek et al. “The security of practical quantum key distribution”, Reviews of Modern Physics 81.3, 2009
  • 13. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 2, June 2014 25 [27] Brassard Gilles, Norbert Lutkenhaus, Tal Mor, Barry C. Sanders, “Security aspects of practical quantum cryptography”, Springer Advances in Cryptology-EUROCRYPT, 2000 [28] Sun, Shi-Hai, Mu-Sheng Jiang, Lin-Mei Liang, “Passive Faraday-mirror attack in a practical two-way quantum-key-distribution system”, Physical Review A 83.6, 2011 [29] Lydersen Lars, Carlos Wiechers, Christoffer Wittmann, Dominique Elser, Johannes Skaar, Vadim Makarov, “Hacking commercial quantum cryptography systems by tailored bright illumination”, Nature photonics 4.10, 2010 , pp. 686-689 [30] Huang Jingzheng, Yin Zhenqiang, Chen Wei, Wang Shuang, Li Hongwei, Guo Guangcan et al, “A survey on device-independent quantum communications”, China Communications 10.2, pp 1-10, 2013 [31] Barrett J, Hardy L, Kent A, “No Signalling and Quantum Key Distribution”, Physical Review Letters 95.1, 2005 [32] Acin A, Gisin N, Masanes L,“From Bell’s Theorem to Secure Quantum Key Distribution”, Physical Review Letters 97.12, 2006 [33] Brassard Gilles, Norbert Lütkenhaus, Tal Mor and Barry C. Sanders, “Security aspects of practical quantum cryptography”, Advances in Cryptology—EUROCRYPT 2000, Springer Berlin Heidelberg, 2000, pp. 289-299 [34] Mayers Dominic, “Unconditional security in quantum cryptography”, Journal of the ACM (JACM), 48, no. 3, 2001, pp. 351-406 [35] Damian Pitalua-Garcia, “Quantum Information, Bell Inequalities and the No-Signalling Principle,” Ph.D. dissertation, Gonville and Caius College, University of Cambridge, September 2013 Authors Minal Lopes received B.E. and M.E. degrees in Electronics Engineering from Mumbai University. She is working as an Assistant Professor at St. Francis Institute of Technology Mumbai, Ind ia. Currently, she is pursuing PhD under guidance of Dr. Nisha Sarwade at the VJTI, Mumbai, India. Her areas of specialization are Quantum cryptography, Data and Network security and Next generation Networks. Dr. Nisha Sarwade received B.E. degree in Electronics Engineering from Jiwaji University, Gwalior and M.E. (Solid State Electronics) and PhD (Electronic Engineering) from University of Roorkee. She was working as a lecturer at the Universit y of Roorkee during 1983-1987. Currently she is working as an Associate Professor at the VJTI, Mumbai, India. Her research interests include Nano Electronics with emphasis on CNT, Compound semiconductors, High-k dielectrics and flash memories and Microwave circuit design. She has 56 national as well as international publications to her credit.