Quantum Key Distribution (QKD) John A Clark Dept. of Computer Science University of York, UK

Slides:



Advertisements
Similar presentations
Quantum Cryptography Post Tenebras Lux!
Advertisements

Quantum Cryptography Nick Papanikolaou Third Year CSE Student
Slide 1 Introduction to Quantum Cryptography Nick Papanikolaou
1 390-Elliptic Curves and Elliptic Curve Cryptography Michael Karls.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Quantum Cryptography ( EECS 598 Presentation) by Amit Marathe.
QUANTUM CRYPTOGRAPHY ABHINAV GUPTA CSc Introduction [1,2]  Quantum cryptography is an emerging technology in which two parties can secure network.
Quantum Cryptography Ranveer Raaj Joyseeree & Andreas Fognini Alice Bob Eve.
Quantum Cryptography Qingqing Yuan. Outline No-Cloning Theorem BB84 Cryptography Protocol Quantum Digital Signature.
QUANTUM CRYPTOGRAPHY Narayana D Kashyap Security through Uncertainty CS 265 Spring 2003.
Quantum Key Distribution Yet another method of generating a key.
Introduction to Quantum Cryptography Dr. Janusz Kowalik IEEE talk Seattle, February 9,2005.
A Brief Introduction to Quantum Computation 1 Melanie Mitchell Portland State University 1 This talk is based on the following paper: E. Rieffel & W. Polak,
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.
Csci5233 Computer Security & Integrity 1 Cryptography: Basics (2)
EEC 688/788 Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Quantum Key Establishment Wade Trappe. Talk Overview Quantum Demo Quantum Key Establishment.
BB84 Quantum Key Distribution 1.Alice chooses (4+  )n random bitstrings a and b, 2.Alice encodes each bit a i as {|0>,|1>} if b i =0 and as {|+>,|->}
Quantum Computing John A Clark Dept. of Computer Science University of York, UK York CS Seminar 19 February 2003.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Lo-Chau Quantum Key Distribution 1.Alice creates 2n EPR pairs in state each in state |  00 >, and picks a random 2n bitstring b, 2.Alice randomly selects.
Single Photon Quantum Encryption Rob Grove April 25, 2005.
Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
CRYPTOGRAPHY Lecture 10 Quantum Cryptography. Quantum Computers for Cryptanalysis Nobody understands quantum theory. - Richard Feynman, Nobel prize-winning.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
CS4600/5600 Biometrics and Cryptography UTC/CSE
Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.
Gagan Deep Singh GTBIT (IT) August 29,2009.
Physics is becoming too difficult for physicists. — David Hilbert (mathematician)
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography (III)
Security in Computing Chapter 12, Cryptography Explained Part 7 Summary created by Kirk Scott 1.
Quantum Cryptography. Cryptography  Art of writing messages so that no one other than intended receiver can read it.  Encryption – Performing mathematical.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
CHAPTER 15: Quantum cryptography
Quantum cryptography CS415 Biometrics and Cryptography UTC/CSE.
Quantum Cryptography Zelam Ngo, David McGrogan. Motivation Age of Information Information is valuable Protecting that Information.
Trondheim 2002 NTNU Quantum Cryptography FoU NTNU Vadim Makarov and Dag R. Hjelme Institutt for fysikalsk elektronikk NTNU Norsk kryptoseminar,
Introduction to Quantum Key Distribution
Quantum Cryptography Physics 43, SRJC.Spring 11 May 9, 2011 Chris Wenrich Homer Van Grinsimpson aka Seth Van Grinsven James Anderson.
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
Quantum Cryptography: Quantum Key Distribution CSE 825.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
Quantum Mechanics1 Schrodinger’s Cat. Quantum Mechanics2 A particular quantum state, completely described by enough quantum numbers, is called a state.
Nawaf M Albadia
Applications of Quantum Cryptography – QKD CS551/851CRyptographyApplicationsBistro Mike McNett 6 April 2004 Paper: Chip Elliott, David Pearson, and Gregory.
28 April 2005 CS588 Spring 2005 David Evans Phun with Photons.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
Quantum Cryptography Antonio Acín
Quantum Cryptography and Quantum Computing. Cryptography is about a)manipulating information b)transmitting information c)storing information.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
Presented By, Mohammad Anees SSE, Mukka. Contents Cryptography Photon Polarization Quantum Key Distribution BB84 Protocol Security of Quantum Cryptography.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
-SECRECY ENSURED TECHNOLOGYKEY DISTRIBUTUION CLASSICAL CRYPTOGRAPHY QUANTAM CRYPTOGRAPHY WORKING INTRODUCTION SECURITY CONCLUSION ADVANTAGESLIMITATIONS.
15-853Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” Including Quantum Communication Quantum Computing.
Encryption and Integrity
J. Miranda University of Ottawa 21 November 2003
COMPSCI 290.2: Computer Security
Quantum Information Promises new insights Anthony J
Weak Value Assisted Quantum Key Distribution
Quantum Key Distribution
Quantum Cryptography Alok.T.J EC 11.
Brandin L Claar CSE 597E 5 December 2001
Quantum Information with Continuous Variables
Lecture 14: Blocking and Catching Photons Background
Quantum Cryptography Scott Roberts CSE /01/2001.
Quantum Technology programme
Spin Many quantum experiments are done with photon polarization instead of electron spin Here is the correspondence between the two And the measurement.
Presentation transcript:

Quantum Key Distribution (QKD) John A Clark Dept. of Computer Science University of York, UK

Communication The only really secure cryptosystem is the one-time pad (provided you use it only once, which hasn’t always been the case). Essentially both participants possess the same random bit stream b1 b2 b3 b4….. The sender has a message m1 m2 m3 m4 …. Encodes message as c1 c2 c3 c4 Receiver applies b1 b2 b3 b4 to obtain message But how can we distribute this keystream b1 b2 b3 b4…?

When Alice met Bob Communicants will (following tradition) be Alice and Bob, trying to communicate their love… Eve isn’t happy about this. She wants to listen in and interfere AliceBob Eve

Basic Scheme Basic scheme based on polarisation of photons y x z Photons are transverse magnetic waves – magnetic and electric fields are perpendicular to the direction of propagation. Also they are perpendicular to each other.

Photons We will assume that we are dealing with linearly polarised light but other schemes are possible (e.g. with circularly polarised light). We need to create photons that with an electric field oscillating in the desired magnetic plane. One way to do this is by passing light through an appropriate polariser More sophisticated way is to use a Pockels Cell. Only vertically polarised photons emerge

Detecting Photons Possible to detect absorption by using a Calcite crystal Photon Detector

Measuring a Photon  Suppose photon has polarisation at angle  to a horizontal filter. Measured as a 0 (absorbed) with prob=sin 2 . Measured as a 1 (permitted) with prob=cos 2 .

Blocking is Freedom Intensity 1.0 Intensity 0.5 Intensity 0 Intensity 0.125

Basic Scheme Basic scheme assumes that the polarisation of photons can be arranged. For example Vertical Polarisation denotes 0 Horizontal Polarisation denotes 1

Rectilinear Basis Suppose now that Alice sends a 0 in this scheme and that Bob uses a photon detector with the same basis. Alice Sends 0 Alice Sends 1 Bob Receives 0 Bob Receives 1

Diagonal Basis Can also arrange this with a diagonal basis Alice Sends 0 Alice Sends 1 Bob Receives 0 Bob Receives 1

Basis Mismatch What if Alice and Bob choose different bases? Alice Sends 0 Bob Receives 0 Bob Receives 1 Each result with probability 1/2

Use of Basis Summary A sender can encode a 0 or a 1 by choosing the polarisation of the photon with respect to a basis Vertical => 0 Horizontal => 1; or 45 degrees => 0, 135 o =>1 The receiver Bob can observe (measure) the polarisation with respect to either basis. If same basis then bits are correctly received If different basis then only 50% of bits are correctly received. This notion underpins one of the basic quantum cryptography key distribution schemes.

What’s Eve up To? Now Eve gets in on the act and chooses to measure the photon against some basis and then retransmit to Bob.

Eve’s Dropping In Suppose Eve listens in using the same basis as Alice, measures the photon and retransmits a photon as measured (she goes undetected) Alice Sends 0 Alice Sends 1 To Bob Eve Measures 0 Eve Measures 1

Eve’s Dropping In Suppose Eve listens in using a different basis to Alice Similarly if Alice sends a 1 (or if Alice uses diagonal basis and Eve uses rectilinear one) Alice Sends 0 To Bob Eve Measures 0 Eve Measures 1 0 and 1 equally likely results

Summary of Eve’s Droppings If Eve gets the basis wrong, then even if Bob gets the same basis as Alice his measurements will only be 50 percent correct. If Alice and Bob become aware of such a mismatch they will deduce that Eve is at work. A scheme can be created to exploit this.

Alice and Bob To send and receive a photon Alice and Bob choose a basis randomly. Alice sends a 0 or 1 using her basis and Bob uses his basis to measure it. Alice records the basis she used and the value sent. Bob records the basis he used and the value he measured.

When We are in Harmony Throw away results when bases disagree and keep results when bases agree Keep Value Discard Value Keep Value Discard Value AliceBob

We Agree Alice and Bob exchange a sequence of bit values encoded in photon polarisation with bases chosen at random. Bob announces via an unjammable channel which bases he used in each case. Alice tells Bob whether choices of basis were correct. They throw away any bit values where the basis choice disagreed and keep those bit values were the basis choice agreed.

Has Eve Listened In? Now we need to determine whether Eve has been listening in. How might this be done?

Has Eve Listened In? Can pick some bits at random and tell each other what values were sent and received. Sufficiently many mismatches then high chance of Eve at work.

Has Eve Listened In? Can pick some random subset and determine the parity of the bit values sent and received. If parities disagree then Eve may have been at work or else there has been an error. Even if agree, parity information has been publicly broadcast – so we discard the final contributing bit. Can repeat this process numerous times to gain increased confidence.

Creating Photons In practice creating a single photon may not be that easy. Can be done with dim light pulses. But if two photons get created one can be captured and measured whilst the other goes through to Alice. They would both have the same polarisation so the security here would be broken.

Keeping it All in Line The kit used to carry out key distribution way may be rather sensitive to disturbance. May need continuous adjustment to maintain right physical set up etc.

Entangled States We have described the best known of protocols for key distribution. Various others are possible. For example, based on entanglement with elements of an entangled pair sent to each of Bob and Alice. Scheme due to Artur Ekert (Oxford).

General Usage Significant interest in QKD. We don’t need to use it for everything. Can use it to distribute key distribution keys. Keys we can use to carry out conventional key distribution protocols securely. Note: no prior contact is necessary.

Aside QKD here relies on being able to detect Eve’s interfering. Possible to go to other extreme and assume that data will be intercepted: More conventional schemes proposed where trillions of bits per second would be transmitted and only sender and receiver know the (very small) time window for the key. Idea is to swamp an interceptor with so much data that they cannot possibly cope.

Summary Have outlined basics of a photon-based scheme that allows a key to be created and shared between two communicants in a manner that allows eavesdropping to be detected. Makes use of one of the fundamental features of quantum mechanics Looking (measuring) disturbs things QKD works! Experiments over 10’s of kilometres using fibre optics. Work also in free space. Aim for QKD with low orbiting satellites.