Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Quantum Cryptography by Asert Seminar 6699 views
- Quantam cryptogrphy ppt (1) by deepu427 10152 views
- Quantum cryptography by Priya Winsome 5856 views
- Quantum Cryptography by pixiejen 1819 views
- Quantum cryptography by Sukhdeep Kaur 4790 views
- Quantum Cryptography and Possible A... by Arinto Murdopo 2518 views

4,738 views

Published on

No Downloads

Total views

4,738

On SlideShare

0

From Embeds

0

Number of Embeds

21

Shares

0

Downloads

526

Comments

0

Likes

2

No embeds

No notes for slide

- 1. A PRESENTATION ON QUANTUM CRYPTOGRAPHY<br />
- 2. SOUGATO GHOSH ECE 22<br />
- 3. What is cryptography?<br />Cryptography (derived from the Greek words kryptos and grapheinmeaning hidden writing) is the science of codes and ciphers. <br />.<br />
- 4. A cipher is essentially a cryptographic<br /> algorithm which is used to convert a message, known as the plaintext, into unreadable<br /> text.<br /><ul><li>Then the message can then be safely transmitted without fear of letting sensitive information fall into the hands of the enemy.</li></ul>What is cipher?<br />
- 5. The process<br />Plaintext<br />Key<br />Sender <br />Encryption<br />Cryptotext<br />Secure<br />transmission<br />Decryption<br />Recipient<br />Plaintext<br />Key ready for use<br />Message encryption<br />Secure key distribution<br />Hard Problem for conventional<br />encryption<br />
- 6. The classic cryptography<br />Encryption algorithm and related key are kept secret.<br />Breaking the system is hard due to large numbers of possible keys.<br />For example: for a key 128 bits long<br />there are<br />keys to check using brute force.<br />The fundamental difficulty is key distribution to parties<br /> who want to exchange messages.<br />
- 7. PKC :the modern cryptography<br />In 1970s the Public Key Cryptography emerged.<br />Each user has two mutually inverse keys,<br />The encryption key is published;<br />The decryption key is kept secret.<br />Anybody can send a message to x<br /> but only xcan read it.<br />
- 8. RSA<br />The most widely used PKC is the RSA algorithm based on the difficulty of <br />factoring a product ot two large primes.<br />Easy ProblemHard Problem<br />Given n <br />compute p and q.<br />Given two large<br /> primes p and q <br />compute <br />
- 9. Light waves are propagated as discrete quanta called photons.<br />They are massless and have energy, momentum and angular momentum called spin.<br />Spin carries the polarization.<br />If on its way we put a polarization filter<br /> a photon may pass through it or may not.<br />We can use a detector to check of a photon has passed through a filter.<br />Elements of the Quantum Theory<br />
- 10. Introduction<br />Spawned during the last century<br />Describes properties and interaction between matter at small distance scales<br />Quantum state determined by(among others)<br />Positions<br />Velocities<br />Polarizations<br />Spins<br />qubits<br />
- 11. Binary information<br />Each photon carries one qubitof information<br />Polarization can be used to represent a 0 or 1.<br />In quantum computation this is called <br />qubit.<br />
- 12. Notation<br />Bra/Ket notation (pronounced “bracket”)<br />From Dirac 1958<br />Each state represented by a vector denoted by a arrow pointing in the direction of the polarization<br />
- 13. Notation<br />Simplified Bra/Ket-notation in this presentation<br />Representation of polarized photons:<br />horizontally: <br />vertically: <br />diagonally: and <br />
- 14. Polarized photons<br />Measurement of a state not only measures but actually transforms that state to one of the basis vectors and <br />If we chose the basis vectors and when measuring the state of the photon, the result will tell us that the photon's polarization is either or , nothing in between.<br />ψ<br />b<br /><br />a<br /><br />
- 15. Experiment<br />Classical experiment<br />Equipment:<br />laser pointer <br />three polarization filters<br />The beam of light i pointed toward a screen.<br />The three filters are polarized at , and respectively <br />
- 16. Experiment<br />The filter is put in front of the screen<br />Light on outgoing side of filter is now 50% of original intensity<br /><br /><br /><br />
- 17. Experiment<br />Next we insert a filter whereas no light continue on the output side<br /><br /><br /><br /><br /><br />
- 18. Experiment<br />Here is the puzzling part…<br />We insert a filter in between<br />This increases the number of photons passing through<br /><br /><br /><br /><br /><br /><br /><br />
- 19. Experiment explained<br />Filter is hit by photons in random states. It will measure half of the photons polarized as <br /><br /><br /><br /><br /><br /><br /><br />
- 20. Experiment explained<br />Filter is perpendicular to that and will measure the photons with respect to , which none of the incoming photons match<br /><br /><br /><br /><br /><br /><br /><br />
- 21. Experiment explained<br />Filter measures the state with respect to the basis {, }<br /><br /><br /><br /><br /><br /><br /><br />
- 22. Experiment explained<br />Photons reaching filter will be measured as with 50% chance. These photons will be measured by filter as with 50% probability and thereby 12,5% of the original light pass through all three filters.<br /><br /><br /><br /><br /><br /><br /><br />
- 23. Key distribution<br />Alice and Bob first agree on two representations for ones and zeroes <br />One for each basis used, {,}and {, }. <br />This agreement can be done in public<br />Define1 = 0 = 1 = 0 = <br />
- 24. Key distribution - BB84<br />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. <br />Bob measures the state of the photons he receives, with each state measured with respect to randomly chosen basis. <br />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 don't agree are discarded. <br />
- 25. Eavesdropping<br />Eve has to randomly select basis for her measurement<br />Her basis will be wrong in 50% of the time.<br />Whatever basis Eve chose she will measure 1 or 0<br />When Eve picks the wrong basis, there is 50% chance that she'll measure the right value of the bit<br />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. <br />
- 26. Eavesdropping<br />
- 27. Eves problem<br />Eve has to re-send all the photons to Bob <br />Will introduce an error, since Eve don't know the correct basis used by Alice <br />Bob will detect an increased error rate<br />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. <br />
- 28. Detecting eavesdropping<br />When Alice and Bob need to test for eavesdropping<br />By randomly selecting a number of bits from the key and compute its error rate<br />Error rate < Emax assume no eavesdropping<br />Error rate > Emax assume eavesdropping(or the channel is unexpectedly noisy)Alice and Bob should then discard the whole key and start over<br />
- 29. Noise<br />Noise might introduce errors<br />A detector might detect a photon even though there are no photons<br />Solution:<br />send the photons according to a time schedule.<br />then Bob knows when to expect a photon, and can discard those that doesn't fit into the scheme's time window.<br />There also has to be some kind of error correction in the over all process.<br />
- 30. Error correction<br />Suggested by Hoi-Kwong Lo. (Shortened version)<br />Alice and Bob agree on a random permutation of the bits in the key<br />They split the key into blocks of length k<br />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<br />This is repeated with different permutations and block size, until Alice and Bob fail to find any disagreement in many subsequent comparisons<br />
- 31. Privacy amplification<br />Eve might have partial knowledge of the key. <br />Transform the key into a shorter but secure key<br />Suppose there are n bits in the key and Eve has knowledge of m bits. <br />Randomly chose a hash function whereh(x): {0,1}n {0,1} n-m-s<br />Reduces Eve's knowledge of the key to 2 –s / ln2 bits<br />
- 32.
- 33.
- 34. Binary information<br />A user can suggest a key by sending a stream of randomly polarized photons.<br />This sequence can be converted to a binary key.<br />If the key was intercepted it could be discarded and a new stream of randomly polarized photons sent.<br />
- 35. It solved thekey distribution problem.<br />Unconditionally secure key distribution method proposed by: Charles Bennett and Gilles Brassard in 1984.<br />.<br />The method is called BB84.<br />Once key is securely received it can be used to encrypt messages transmitted<br /> by conventional channels. <br />The Main contribution of Quantum Cryptography.<br />
- 36. Quantum cryptography obtains its fundamental security from the fact that each qubit is carried by a single photon, and each photon will be altered as soon as it is read.<br />This makes impossible to intercept message without being detected.<br />Security of quantum key distribution<br />
- 37. Experimental implementations have existed since 1990.<br />Current (2004) QC is performed over distances of 30-40 kilometers using <br /> optical fiber.<br /> In general we need two capabilities.<br />Single photon gun.<br />(2) Being able to measure single photons.<br />State of the Quantum Cryptography technology.<br />
- 38. id Quantique, Geneva Switzerland<br />Optical fiber based system<br />Tens of kilometers distances<br />MagiQ Technologies, NY City<br />Optical fiber-glass<br />Up to 100 kilometers distances<br />NEC Tokyo 150 kilometers<br />QinetiQ Farnborough, England<br />Through the air 10 kilometers.<br />Supplied system to BBN in Cambridge Mass.<br />Commercial QC providers<br />
- 39. References<br />[WIK2] Wikipedia -The free encyclopediahttp://www.wikipedia.org/wiki/Interpretation_of_quantum_mechanics<br />[WIK3] Wikipedia -The free encyclopediahttp://www.wikipedia.org/wiki/Copenhagen_interpretation<br />[GIT] Georgia Institute of Technology,The fundamental postulates of quantum mechanicshttp://www.physics.gatech.edu/academics/Classes/spring2002/6107/Resources/The fundamental postulates of quantum mechanics.pdf<br />[HP] Hoi-Kwong Lo, Networked Systems Department,Hewlett Packard, Bristol, December 1997, Quantum Cryptology<br />[SS99] Simon Singh, Code Book, p349-382,Anchor Books, 1999<br />[FoF] Forskning och Framsteg,No. 3, April 2003<br />
- 40. THANKS…………………..<br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment