Quantum Cryptography: D.Deepika B.Tech Iv Year
Quantum Cryptography: D.Deepika B.Tech Iv Year
CRYPTOGRAPHY
D.DEEPIKA
B.TECH IV YEAR
CRYPTOGRAPHY
(krypts)
hidden
+
(grpho)
write
=
Hidden Writing
INTRODUCTION
What is Cryptography?
HISTORY OF QUANTUM
CRYPTOGRAPHY
QUANTUM CRYPTOGRAPHY
Key distribution
Eavesdropping
Detecting eavesdropping
Noise
Error correction
Privacy Amplification
Encryption
KEY DISTRIBUTION
Alice and Bob first agree on two representations for
ones and zeroes
One for each basis used, {,}
and {, }.
This agreement can be done in public
Define
1= 0=
1= 0=
KEY DISTRIBUTION
2.
3.
EAVESDROPPING
Eve has to randomly select basis for her
measurement
Her basis will be wrong in 50% of the time.
Whatever basis Eve chose she will measure 1 or 0
When Eve picks the wrong basis, there is 50%
chance that she'll measure the right value of the
bit
E.g. Alice sends a photon with state
corresponding to 1 in the {,} basis. Eve picks the
{, } basis for her measurement which this time
happens to give a 1 as result, which is correct.
Alices
basis
Alices
bit
Alices
photon
1
{,}
Eves
basis
Correct
Eves
photon
Eves
bit
Correct
{,}
Yes
Yes
{, }
No
Yes
No
{,}
Yes
Yes
{, }
No
No
Yes
Yes
No
{,}
1
{, }
0
No
{, }
Yes
Yes
{,}
No
No
Yes
Yes
{, }
yes
EVES PROBLEM
DETECTING EAVESDROPPING
When Alice and Bob need to test for
eavesdropping
By randomly selecting a number of bits from the
key and compute its error rate
Error rate < E
max assume no eavesdropping
NOISE
Noise might introduce errors
A detector might detect a photon even though
there are no photons
Solution:
send the photons according to a time schedule.
Then Bob knows when to expect a photon, and
can discard those that doesn't fit into the
scheme's time window.
There also has to be some kind of error correction
in the over all process.
ERROR CORRECTION
Alice and Bob agree on a random permutation of
the bits in the key
They split the key into blocks of length k
Compare the parity of each block. If they compute
the same parity, the block is considered correct. If
their parity is different, they look for the
erroneous bit, using a binary search in the block.
Alice and Bob discard the last bit of each block
whose parity has been announced
This is repeated with different permutations and
block size, until Alice and Bob fail to find any
disagreement in many subsequent comparisons
PRIVACY AMPLIFICATION
ENCRYPTION
Key of same size as the plaintext
Used as a one-time-pad
Ensures the crypto text to be absolutely
unbreakable
ADVANTAGES:
DISADVANTAGES:
Transmission time for documents encrypted using
public key cryptography are significantly slower then
symmetric cryptography. In fact, transmission of very
large documents is prohibitive.
The key sizes must be significantly larger than
symmetric cryptography to achieve the same level of
protection.
Public key cryptography is susceptible to
impersonation attacks.
CONCLUSION
Quantum cryptography is a major achievement
in security engineering.
As it gets implemented, it will allow perfectly
secure bank transactions, secret discussions for
government officials, and well-guarded trade
secrets for industry!
QUERIES
THANK U