Quantum Cryptography: Quantum Key Distribution CSE 825.

Slides:



Advertisements
Similar presentations
Quantum Cryptography Post Tenebras Lux!
Advertisements

Quantum Cryptography Nick Papanikolaou Third Year CSE Student
Cryptography and Network Security 2 nd Edition by William Stallings Note: Lecture slides by Lawrie Brown and Henric Johnson, Modified by Andrew Yang.
Intro to Quantum Cryptography Algorithms Andrew Hamel EECS 598 Quantum Computing FALL 2001.
Implementation of Practically Secure Quantum Bit Commitment Protocol Ariel Danan School of Physics Tel Aviv University September 2008.
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 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 Key Distribution (QKD) John A Clark Dept. of Computer Science University of York, UK
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.
Rita Pizzi Department of Information Technology Università degli Studi di Milano.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.
Quantum Cryptography Marshall Roth March 9, 2007.
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 Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.
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.
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
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
Gagan Deep Singh GTBIT (IT) August 29,2009.
By Nicholas Moradi CST 300L Fall In 1979 Quantum Cryptography was established by Gilles Brassard For security reasons the key had to be unable to.
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.
April 12, 2006 Berk Akinci 1 Quantum Cryptography Berk Akinci.
Quantum Cryptography Beyond the buzz Grégoire Ribordy CERN, May 3rd 2006.
Quantum Cryptography. Cryptography  Art of writing messages so that no one other than intended receiver can read it.  Encryption – Performing mathematical.
Chapter 3: Basic Protocols Dulal C. Kar. Key Exchange with Symmetric Cryptography Session key –A separate key for one particular communication session.
Device-independent security in quantum key distribution Lluis Masanes ICFO-The Institute of Photonic Sciences arXiv:
Trondheim 2003 NTNU Vadim Makarov Lecture in "Fiberkomponenter" course, November 13, 2003 Quantum Cryptography Kvantekryptering.
Quantum cryptography CS415 Biometrics and Cryptography UTC/CSE.
Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark ECRYPT Autumn School, Bertinoro Wednesday, October.
Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark 9 th workshop on QIP 2006, Paris Tuesday, January.
1 A Randomized Space-Time Transmission Scheme for Secret-Key Agreement Xiaohua (Edward) Li 1, Mo Chen 1 and E. Paul Ratazzi 2 1 Department of Electrical.
IIS 2004, CroatiaSeptember 22, 2004 Quantum Cryptography and Security of Information Systems 1 2
Quantum Cryptography Zelam Ngo, David McGrogan. Motivation Age of Information Information is valuable Protecting that Information.
Chapter 7 – Confidentiality Using Symmetric Encryption.
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 Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
Nawaf M Albadia
Applications of Quantum Cryptography – QKD CS551/851CRyptographyApplicationsBistro Mike McNett 6 April 2004 Paper: Chip Elliott, David Pearson, and Gregory.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
A quantum leap: Researchers create super-secure computer network Seungjai Min Hansang Bae Hwanjo Heo.
Quantum Cryptography and Quantum Computing. Cryptography is about a)manipulating information b)transmitting information c)storing information.
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
QUANTUM CRYPTOGRAPHY.
Quantum Cryptography Arjun Vinod S3 EC Roll No:17.
By Jeff Hinson CS691, Summer 2009
Quantum Key Distribution
Quantum Cryptography Alok.T.J EC 11.
Security through Encryption
Brandin L Claar CSE 597E 5 December 2001
Quantum Cryptography Scott Roberts CSE /01/2001.
Fiber Optic Transmission
Presentation transcript:

Quantum Cryptography: Quantum Key Distribution CSE 825

Quantum Cryptography is different than Quantum Computing. Confusing because there is only one algorithm for a quantum computer and it factors large numbers so its primary purpose is to break cryptography. Michigan State University2

Private (secret) Key A k-bit secret key is shared by two users. The assumption is that finding a particular key is intractable (brute force). If advances in computing make it tractable, choose a longer key. 3

Notation Players: A & B Named: Alice & Bob Who is the bad guy? Michigan State University4

Secret Key = one-time pad Alice converts message into a string of bits and XORs with the key. 5

Michigan State University Secret Key = one-time pad Alice converts message into a string of bits and XORs with the key. Each key bit is used once (reuse allows deduction about the message). 6

Michigan State University Secret Key = one-time pad Alice converts message into a string of bits and XORs with the key. Each key bit is used once (reuse allows deduction about the message). Bob XORs the key with the received string to extract the original message. 7

Michigan State University Secret Key = one-time pad Alice converts message into a string of bits and XORs with the key. Each key bit is used once (reuse allows deduction about the message). Bob XORs the key with the received string to extract the original message. Without the key an eavesdropper sees random bits. 8

Michigan State University Key Distribution Key distribution is the problem of getting a secure key to both parties. 9

Michigan State University Quantum Key Distribution Quantum Cryptography uses quantum properties to securely distribute a secret key. 10

Michigan State University History of Quantum Cryptography 1970s concept proposed by Weisner 1984 Bennett and Brassard developed the first quantum cryptography protocol: BB first experimental demonstration (32 cm) 2002 first commercial product available ( 11

Michigan State University Quantum Mechanics Elements of quantum information, typically photons, are put in a particular state by the sender and then observed by the receiver. Because of the Uncertainty Principle certain quantum information occurs as conjugates that cannot be measured simultaneously. 12

Michigan State University Quantum Mechanics Polarization of photons can be expressed in any of three different bases: rectilinear, circular, and diagonal but observing in one basis randomizes the conjugates. If the sender and receiver are not using the same base, reading the information effectively destroys it (randomizes it) without yielding useful information. 13

Michigan State University Unpolarized light enters a vertically aligned filter, which absorbs some of the light and polarizes the remainder in the vertical direction. A second filter tilted at some angle q absorbs some of the polarized light and transmits the rest, giving it a new polarization If first filter is a + and the second is an X, matched polarization passes through, mismatches pass randomly 14

Michigan State University A quantum cryptography system allows two people, say Alice and Bob, to exchange a secret key. Alice uses a transmitter to send photons in one of four polarizations: 0, 45, 90 or 135 degrees. Bob uses a receiver to measure each polarization in either the rectilinear basis (0 and 90) or the diagonal basis (45 and 135); according to the laws of quantum mechanics he cannot simultaneously make both measurements. Important: photons are sent one at a time! 15

Michigan State University Alice sends photons with one of the four polarizations, chosen at random. 16

Michigan State University Alice sends photons with one of the four polarizations, chosen at random. For each photon, Bob chooses at random the type of measurement: + or X 17

Michigan State University Alice sends photons with one of the four polarizations, chosen at random. For each photon, Bob chooses at random the type of measurement: + or X Bob records the result of his measurements, but keeps it a secret. 18

Michigan State University Alice sends photons with one of the four polarizations, chosen at random. For each photon, Bob chooses at random the type of measurement: + or X Bob records the result of his measurements, but keeps it a secret. Bob tells Alice the measurement types used (but not results) in freespace. Alice tells him which were correct. 19

Alice sends photons with one of the four polarizations, chosen at random. For each photon, Bob chooses at random the type of measurement: + or X Bob records the result of his measurements, but keeps it a secret. Bob tells Alice the measurement types used (but not results) in freespace. Alice tells him which were correct. Alice and Bob keep correct cases and translate to 0’s and 1’s

Michigan State University Eve Since reading a bit destroys it, to eavesdrop Eve must regenerate bits. 21

Michigan State University Eve Since reading a bit destroys it, to eavesdrop Eve must regenerate bits. Half the time she will read and regenerate correctly. 22

Michigan State University Eve Since reading a bit destroys it, to eavesdrop Eve must regenerate bits. Half the time she will read and regenerate correctly. Combine that with Bob reading correctly half the time, means that ¼ of the time Eve will generate an error visible to Bob & Alice. 23

Michigan State University Check As a check, Alice and Bob choose some bits at random to reveal. 24

Michigan State University Check As a check, Alice and Bob choose some bits at random to reveal. If the bits agree, they can use the remaining bits with assurance that they have not been intercepted. 25

Michigan State University Check As a check, Alice and Bob choose some bits at random to reveal. If the bits agree, they can use the remaining bits with assurance that they have not been intercepted. But if they find significant discrepancies, it indicates tampering due to eavesdropping, and they should start over to transmit another key. 26

Michigan State University Why it works? If eavesdropper Eve observes the data, she disturbs the quantum state. 27

Michigan State University Other options for Eve Eve could also attempt to listen to only a small number of bits going by in hopes that she can know a few bits and go undetected. Alice and Bob can prevent this attack by shrinking their secret key down after having established it ( “ privacy amplification ” ). If they shrink their key in the right way, Eve's chances of knowing even one bit would be very small. 28

Michigan State University If Eve happens to choose the same basis as Bob, he will not notice—he will get the same result, and the same result as if she had done nothing. However, Eve doesn't know what basis Bob will choose to measure in. If Eve measures in the X basis and Bob measures in the Z basis (or vice-versa), Bob's result will now be random— even if the original state was prepared in the Z basis! 29

Michigan State University If Eve is observing, when Alice and Bob compare notes about the value of observed bits, half the time, their bits will be different when they should be the same. 30

Michigan State University Noise Noise exists and Eve introduces more noise. 31

Michigan State University Noise Noise exists and Eve introduces more noise. Alice and Bob eliminate noise with public error correction: e.g. public communication of the parity of small subsets of the key. By always withholding the last bit, the public parity discussion is harmless 32

Michigan State University Attacks Single photon QKD proven secure against “ collective attack ”, conjectured to be the strongest “ joint attack ” (I don ’ t understand either the terminology or the proof.) A “ man in the middle ” attack protected by “ classical privacy amplification ” (single photon?) 33

More Attacks Actual physical devices aren’t as perfect as assumed in the theorems: occasionally there are multiple photons. Can that result in a practical attack? Privacy amplification can handle Eve knowing a few bits. Decoy states can help identify Eve’s snooping by lowering energy to prevent multiple protons for short periods known to Alice and Bob. Michigan State University34

“Blinding” seemed to be an effective attack, but protection has been found Michigan State University35

MIM What about Man-in-the-middle? Michigan State University36

Michigan State University Could Eve split a multi-photon stream, reducing its intensity, but not its content? – PNS: Photon Number Splitting attack requires storage which currently is not possible. –“ There are various possible solutions to this particular problem; it is the unanticipated flaws that present the greatest security hazard. ” 37

In the BB84 protocol Alice sends quantum states to Bob using single photons. In practice many implementations use laser pulses attenuated to a very low level to send the quantum states. These laser pulses contain a very small number of photons, for example 0.2 photons per pulse, which are distributed according to a Poissonian distribution. This means most pulses actually contain no photons (no pulse is sent), some pulses contain 1 photon (which is desired) and a few pulses contain 2 or more photons. If the pulse contains more than one photon, then Eve can split off the extra photons and transmit the remaining single photon to Bob. This is the basis of the photon number splitting attack, where Eve stores these extra photons in a quantum memory until Bob detects the remaining single photon and Alice reveals the encoding basis. Eve can then measure her photons in the correct basis and obtain information on the key without introducing detectable errors. Michigan State University38

Proof assumptions Eve cannot physically access Alice and Bob's encoding and decoding devices. The random number generators used by Alice and Bob must be trusted and truly random. The classical communication channel must be authenticated using an unconditionally secure authentication scheme. The message must be encrypted using one- time pad like scheme. Michigan State University39

Hacking attacks target vulnerabilities in the operation of a QKD protocol or deficiencies in the components of the physical devices used in construction of the QKD system. If the equipment used in quantum key distribution can be tampered with, it could be made to generate keys that were not secure using a random number generator attack. Another common class of attacks is the Trojan horse attack which does not require physical access to the endpoints: rather than attempt to read Alice and Bob's single photons, Eve sends a large pulse of light back to Alice in between transmitted photons. Alice's equipment reflects some of Eve's light, revealing the state of Alice's basis (e.g., a polarizer). This attack can be detected, e.g. by using a classical detector to check the non- legitimate signals (i.e. light from Eve) entering Alice's system. It is also conjectured that most hacking attacks can similarly be defeated by modifying the implementation, though there is no formal proof. Michigan State University40

Michigan State University Real World Key exchange is now slow: – 1 Mbits/sec over 20 km of optical fiber – 10 kbits/sec over 100 km of optical fiber Distance record is km optical fiber (2007) As long as any existing fiber spans. Free space distance record 144 km Photon loss and errors are limiting factors 41

Commercial id Quantique (Geneva) MagiQ Technologies (New York) QuintessenceLabs (Australia) SeQureNet (Paris) World's first bank transfer using quantum key distribution was done in Vienna, Austria (2004). Id Quantique was used in the Swiss canton of Geneva to transmit ballot results to the capital in the 2007 national election. Battelle Memorial Institute used id Quantique to connect their main campus in Columbus, OH and their manufacturing facility in Dublin, OH (2013). Michigan State University42

The 10-node DARPA Quantum network has been running since 2004 in Massachusetts. (BBN Technologies, Harvard, Boston U. and QinetiQ. The world's first computer network protected by quantum key distribution was implemented in October 2008, at a scientific conference in Vienna (SECOQC: Secure Communication Based on Quantum Cryptography). The network used 200 km of standard fibre optic cable to interconnect six locations across Vienna and the town of St Poelten located 69 km to the west. The Tokyo QKD Network was inaugurated on the first day of the UQCC2010 conference. The network involves an international collaboration between 7 partners; NEC, Mitsubishi Electric, NTT, NICT, Toshiba, Id Quantique, Austrian Institute of Technology (AIT), the Institute for Quantum Optics and Quantum Information (IQOQI) and the University of Vienna. Michigan State University43

A hub-and-spoke network has been operated by Los Alamos National Laboratory since All messages are routed via the hub. The system equips each node in the network with quantum transmitters–i.e., lasers–but not with expensive and bulky photon detectors. Only the hub receives quantum messages. To communicate, each node sends a one-time pad to the hub, which it then uses to communicate securely over a classical link. The hub can route this message to another node using another one time pad from the second node. The entire network is secure, provided that the central hub is secure. Individual nodes require little more than a laser - prototype nodes are around the size of a box of matches. Michigan State University44

Michigan State University 45

Michigan State University BBN + DARPA 46

The current commercial systems are aimed mainly at governments and corporations with high security requirements. Key distribution by courier is typically used in such cases, where traditional key distribution schemes are not believed to offer enough guarantee. This has the advantage of not being intrinsically distance limited, and despite long travel times the transfer rate can be high due to the availability of large capacity portable storage devices. The major difference of quantum key distribution is the ability to detect any interception of the key, whereas with courier the key security cannot be proven or tested. QKD systems also have the advantage of being automatic, with greater reliability and lower operating costs than a secure human courier network. Michigan State University47

Factors preventing wide adoption of quantum key distribution outside high security areas: – the cost of equipment – the lack of a demonstrated threat to existing key exchange protocols. However, with optic fiber networks already present in many countries the infrastructure is in place for a more widespread use. Michigan State University48