Successfully reported this slideshow.
Upcoming SlideShare
×

# Quantam cryptogrphy ppt (1)

15,308 views

Published on

Published in: Technology, Education
• Full Name
Comment goes here.

Are you sure you want to Yes No

Are you sure you want to  Yes  No

### Quantam cryptogrphy ppt (1)

1. 1. QUANTUMCRYPTOGRAPHY D.DEEPIKA B.TECH IV YEAR
2. 2. CRYPTOGRAPHY κρυπτόσ (kryptós) “hidden” + γράυω (grápho) “write” = Hidden Writing
3. 3. INTRODUCTIONWhat is Cryptography? Cryptography is the art of devising codes and ciphers. Crypto analysis is the art of breaking them. Cryptology is the combination of the two i. e Cryptography and Crypto analysisWhat is Quantum Cryptography? Quantum Cryptography is an effort to allow two users of a common communication channel to create a body of shared and secret information. This information, which generally takes the form of a random string of bits, can then be used as a conventional secret key for secure communication. The Heisenberg Uncertainty principle and quantum entanglement can be exploited in as system of secure communication often referred to as “quantum Cryptography”.
4. 4. HISTORY OF QUANTUMCRYPTOGRAPHY Stephen Wiesner wrote “Conjugate Coding” in the late sixties Charles H. Bennett and Gilles Brassard revived the field in 1982 by combining quantum process with public key cryptography
5. 5. QUANTUM CRYPTOGRAPHY Key distribution Eavesdropping Detecting eavesdropping Noise Error correction Privacy Amplification Encryption
6. 6. 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=
7. 7. KEY DISTRIBUTION
8. 8. KEY DISTRIBUTION - BB841. Alice sends a sequence of photons to Bob. Each photon in a state with polarization corresponding to 1 or 0, but with randomly chosen basis.2. Bob measures the state of the photons he receives, with each state measured with respect to randomly chosen basis.3. Alice and Bob communicates via an open channel. For each photon, they reveal which basis was used for encoding and decoding respectively. All photons which has been encoded and decoded with the same basis are kept, while all those where the basis dont agree are discarded
9. 9. 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 shell 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.
10. 10. Alice’s Alice’s Alice’s Eve’s Correct Eve’s Eve’s Correctbasis bit photon basis photon bit {,} Yes  1 Yes 1  {, } No  1 Yes  0 No{,} {,} Yes  0 Yes 0  {, } No  1 No  0 Yes {,} No  1 Yes 1   0 No {, } Yes  1 Yes{, } {,} No  1 No 0   0 Yes {, } yes  0 Yes
11. 11. EVES PROBLEM Eve has to re-send all the photons to Bob Will introduce an error, since Eve dont know the correct basis used by Alice Bob will detect an increased error rate Still possible for Eve to eavesdrop just a few photons, and hope that this will not increase the error to an alarming rate. If so, Eve would have at least partial knowledge of the key.
12. 12. 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 < Emax assume no eavesdropping Error rate > Emax assume eavesdropping (or the channel is unexpectedly noisy) Alice and Bob should then discard the whole key and start over
13. 13. 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 doesnt fit into the schemes time window. There also has to be some kind of error correction in the over all process.
14. 14. 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
15. 15. PRIVACY AMPLIFICATION Eve might have partial knowledge of the key. Transform the key into a shorter but secure key Suppose there are n bits in the key and Eve has knowledge of m bits. Randomly chose a hash function where h(x): {0,1}n  {0,1} n-m-s Reduces Eves knowledge of the key to 2 –s / ln2 bits
16. 16. ENCRYPTION Key of same size as the plaintext Used as a one-time-pad Ensures the crypto text to be absolutely unbreakable
17. 17. ADVANTAGES: The biggest advantage of public key cryptography is the secure nature of the private key. In fact, it never needs to be transmitted or revealed to anyone. It enables the use of digital certificates and digital timestamps, which is a very secure technique of signature authorization.
18. 18. 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.
19. 19. 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!
20. 20. QUERIES
21. 21. THANK U