Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.

Slides:



Advertisements
Similar presentations
Quantum Cryptography Post Tenebras Lux!
Advertisements

Quantum Cryptography Nick Papanikolaou Third Year CSE Student
Use of Time as a Quantum Key By Caleb Parks and Dr. Khalil Dajani.
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 Key Distribution (QKD) John A Clark Dept. of Computer Science University of York, UK
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.
CNS2009handout 21 :: quantum cryptography1 ELEC5616 computer and network security matt barrie
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,
Quantum Computation and Error Correction Ali Soleimani.
Quantum Cryptography Marshall Roth March 9, 2007.
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 Computers Todd A. Brun Communication Sciences Institute USC.
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.
Quantum Cryptography December, 3 rd 2007 Philippe LABOUCHERE Annika BEHRENS.
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.
CS4600/5600 Biometrics and Cryptography UTC/CSE
Two vertical-cavity surface-emitting lasers (VCSEL’s) are used at Alice, as sources of the two encoded states. Both outputs are then attenuated to achieve.
Gagan Deep Singh GTBIT (IT) August 29,2009.
Physics is becoming too difficult for physicists. — David Hilbert (mathematician)
Quantum Information, Communication and Computing Jan Kříž Department of physics, University of Hradec Králové Doppler Institute for mathematical physics.
April 12, 2006 Berk Akinci 1 Quantum Cryptography Berk Akinci.
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
CHAPTER 15: Quantum cryptography
Quantum cryptography CS415 Biometrics and Cryptography UTC/CSE.
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.
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
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
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 Computing by Mathew Ross Jared Davis - Group L -
Nawaf M Albadia
Quantum computing, teleportation, cryptography Computing Teleportation Cryptography.
Quantum Computing Michael Larson. The Quantum Computer Quantum computers, like all computers, are machines that perform calculations upon data. Quantum.
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 and Quantum Computing. Cryptography is about a)manipulating information b)transmitting information c)storing information.
Our Proposed Technique
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Lecture 11: Quantum Cryptography Wayne Patterson SYCS 654 Spring 2009.
Presented By, Mohammad Anees SSE, Mukka. Contents Cryptography Photon Polarization Quantum Key Distribution BB84 Protocol Security of Quantum Cryptography.
Non-locality and quantum games Dmitry Kravchenko University of Latvia Theory days at Jõulumäe, 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.
-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.
J. Miranda University of Ottawa 21 November 2003
COMPSCI 290.2: Computer Security
Paul M. Dooley Tamer Tayea Wenlin Zhou Ian M. Johson Joshua Tarlow
Quantum Information Promises new insights Anthony J
QUANTUM CRYPTOGRAPHY.
Quantum Cryptography Quantum Computing
Cryptography, part 2.
Quantum Cryptography Arjun Vinod S3 EC Roll No:17.
Quantum Key Distribution
Quantum Teleportation
Quantum Cryptography Alok.T.J EC 11.
Brandin L Claar CSE 597E 5 December 2001
Quantum Information with Continuous Variables
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.
Quantum Cryptography Quantum Computing
Quantum Cryptography Quantum Computing
Presentation transcript:

Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005

Introduction Classical cryptography – relies on time complexity of certain mathematical operations given current computing methods Quantum computers – can solve these hard problems in polynomial time. –Example – Shor’s algorithm for finding prime factors of very large numbers Unbreakable code – One-Time pad –Practical difficulty is in key distribution Quantum Cryptography solves this problem by providing secure key distribution using quantum mechanics First suggested by C.Bennett and G.Brassard

Quantum Mechanics Deals with behavior of elementary particles (atoms & energy) in terms of probabilities Energy, momentum & angular momentums as well as charges come in discrete amounts called ‘quanta’ –Photons are discrete bundles of energy that make up light Properties that describe behavior of photon 1.Superposition principle Position or energy of the photon can simultaneously possess 2 or more values Photon Ray Gun experiment

Photon ray gun experiment Fig.1 Fig.2 Fig.3

Quantum Mechanics (contd.) 2.Entanglement property Applies to a pair of spatially separated photon where each is described with reference to other In case of entangled photons – measurement of spin of one gives the spin of other 3.Measurement problem Measuring the state of a photon changes it Polarization of Photons –Photon has electric and magnetic fields represented by vectors perpendicular to each other and direction of travel –Polarization describes the spin nature of a photon determined by electric vector of photon

Quantum State based Coding Scheme Polaroid – a filter to polarize & measure the polarization of photons Using rectilinear and diagonal polarization schemes gives 4 quantum bits or ‘qubits’ + 45 o XX + We shall use the following notations: ‘+’ represents rectilinear scheme (horizontal and vertical polaroids) ‘-’ to represent 0 ‘|’ to represent 1 ‘x’ represents diagonal scheme (left and right inclined diagonal polariods) ‘/ ‘ to represent 0 ‘\’ to represent 1

Qubit transmission and binary digit selection - example Using the above qubit representations, a transmission for the binary could look like this: Alice sends the 1 st 1 using the + scheme, the 2 nd one using the X scheme, 1 st 0 using the X scheme and so on. Alice : Scheme++++XXX+ Alice : Bits Alice : Qubit↕↕↔↕∕∕\↕ Bob : Scheme+XX++XX+ Bob : Qubit↕\\↕↔∕\↕ Bob : Bits Key Selection√√√√√

BB84 protocol – Quantum Key Distribution Step 1: Alice transmits random seq of 1s & 0s (qubits) to Bob over quantum channel –Alice uses random selection of rectilinear and diagonal schemes –Bob also uses random schemes to detect polarization of received photons – so interprets the 1s & 0s correctly only sometimes Step 2: Over a regular channel Alice tells Bob the polarization scheme she used for each qubit –Bob tells Alice when he used the same scheme & notes down bits determined with right scheme Step 3: Out of bits selected Alice & Bob pick a small subset and compare if they got the bits right. Eg:100 out of 500 bits –If the bits match discard bits used to compare & use remaining as the key (for encrypting actual data) –If the bits do not match it could be due to Eve whose detector had modified the polarization of a photon in transmission. So discard all bits and restart from step 1.

Key Selection and Detecting Eve’s presence Bit Number Alice : Bits Alice : Scheme++++XXX+ Alice : Qubit↕↕↔↕∕∕\↕ Eve : SchemeX+X++X+X Eve : Qubit/↕↕↕↔/↕/ Bob : Scheme+XX++XX+ Bob : Qubit↕\\↕↔∕/↔ Bob : Bits Selection√√√√√ Here the bits 1, 4, 6, 7, 8 are selected by Alice and Bob since both of them use the same detection scheme. But when they randomly check bits 1, 7 and 8 they find that the values are different. Through this they can detect the presence of the eavesdropper.

Practical problems with QC Beam Splitting attack –Hard to produce beam of single photons –Eve can use beam splitter when multiple photons are emitted –However it is not easy for Eve to determine when multiple photons are emitted; Splitting single photon will affect the state of the photon and give away Eve’s presence Man in the middle attack –Bob & Alice need proper authentication before talking to each other Distance limitation and media limitation –Fibre optics Optical pulse travels limited distance with out amplification – so have to be done hop by hop. Distance achieved - 87 kms. –Open space communication higher error rate 20 – 30 kms

Thank You!