Quantum Cryptography Ranveer Raaj Joyseeree & Andreas Fognini Alice Bob Eve.

Slides:



Advertisements
Similar presentations
Quantum Cryptography Cryptography Quantum Key Distribution.
Advertisements

Quantum Cryptography ( EECS 598 Presentation) by Amit Marathe.
BY : Darshana Chaturvedi.  INTRODUCTION  RSA ALGORITHM  EXAMPLES  RSA IS EFFECTIVE  FERMAT’S LITTLE THEOREM  EUCLID’S ALGORITHM  REFERENCES.
Ilja Gerhardt QUANTUM OPTICS CQT GROUP Ilja Gerhardt, Matthew P. Peloso, Caleb Ho, Antía Lamas-Linares and Christian Kurtsiefer Entanglement-based Free.
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
Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.
RSA ( Rivest, Shamir, Adleman) Public Key Cryptosystem
Quantum Cryptography Qingqing Yuan. Outline No-Cloning Theorem BB84 Cryptography Protocol Quantum Digital Signature.
Quantum Key Distribution Yet another method of generating a key.
Introduction to Quantum Cryptography Dr. Janusz Kowalik IEEE talk Seattle, February 9,2005.
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.
1 Lecture #10 Public Key Algorithms HAIT Summer 2005 Shimrit Tzur-David.
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.
Xiaohua (Edward) Li1 and E. Paul Ratazzi2
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.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.
CS5204 – Fall Cryptographic Security Presenter: Hamid Al-Hamadi October 13, 2009.
Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 21 “Public-Key Cryptography.
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.
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
RSA Implementation. What is Encryption ? Encryption is the transformation of data into a form that is as close to impossible as possible to read without.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography (III)
RSA Ramki Thurimella.
Security in Computing Chapter 12, Cryptography Explained Part 7 Summary created by Kirk Scott 1.
Security of practical quantum cryptography with heralded single photon sources Mikołaj Lasota 1, Rafał Demkowicz-Dobrzański 2, Konrad Banaszek 2 1 Nicolaus.
Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.
April 12, 2006 Berk Akinci 1 Quantum Cryptography Berk Akinci.
1 candidate: Vadim Makarov Quantum cryptography and quantum cryptanalysis Defence for the degree doktor ingeniør at the Norwegian University of Science.
CSCD 218 : DATA COMMUNICATIONS AND NETWORKING 1
Cryptography Lecture 7: RSA Primality Testing Piotr Faliszewski.
Chapter 21 Public-Key Cryptography and Message Authentication.
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.
Encryption.
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.
Trondheim 2002 NTNU Quantum Cryptography FoU NTNU Vadim Makarov and Dag R. Hjelme Institutt for fysikalsk elektronikk NTNU Norsk kryptoseminar,
Key Exchange Methods Diffie-Hellman and RSA CPE 701 Research Case Study Derek Eiler | April 2012.
Introduction to Quantum Key Distribution
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
15-499Page :Algorithms and Applications Cryptography I – Introduction – Terminology – Some primitives – Some protocols.
Public Key Cryptosystems RSA Diffie-Hellman Department of Computer Engineering Sharif University of Technology 3/8/2006.
Nawaf M Albadia
Quantum Cryptography Antonio Acín
A quantum leap: Researchers create super-secure computer network Seungjai Min Hansang Bae Hwanjo Heo.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
1 Cryptography Troy Latchman Byungchil Kim. 2 Fundamentals We know that the medium we use to transmit data is insecure, e.g. can be sniffed. We know that.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
Security. Cryptography (1) Intruders and eavesdroppers in communication.
Presented By, Mohammad Anees SSE, Mukka. Contents Cryptography Photon Polarization Quantum Key Distribution BB84 Protocol Security of Quantum Cryptography.
INCS 741: Cryptography Overview and Basic Concepts.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
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.
Public-key Cryptography
QUANTUM CRYPTOGRAPHY.
Quantum Cryptography Arjun Vinod S3 EC Roll No:17.
Quantum Key Distribution
Quantum Cryptography Alok.T.J EC 11.
Quantum Cryptography Scott Roberts CSE /01/2001.
Appendix 5: Cryptography p
Presentation transcript:

Quantum Cryptography Ranveer Raaj Joyseeree & Andreas Fognini Alice Bob Eve

Classical Algorithms 1.Asymmetrical (public-key) cryptosystems: - First implementationnn RSA (Ronald Rivest, Adi Shamir, and Leonard Adleman) Very convenient, Internet - Idea is based on computational complexity f(x) = y, x = ?. - rely on unproven assumptions Private Public Message Encrypted message

Classical Algorithms 2. Symmetrical (secret-key) cryptosystems: - only provably secure cryptosystem known today - not handy, key as long as message - key only valid for one transmission - how to send the key in a secure manner? M: K: S: Distribute key over secure channel MM S S: K: M: XOR

Quantum Cryptography: The BB84 Portocol Ingredients: 1) One photon no copying, 2) Two non orthonormal bases sets 3) Insecure classical channel; Internet What it does: Secure distribution of a key, can't be used to send messages How it works: 50% correlated Physikalische Blätter 55, 25 (1999)

Copy machine: e.g. Eve's copy machine 50% decrease in correlation! Alice and Bob recognize attack from error rate!

Conclusion Quantum cryptography means just the exchange of keys Actual transmission of data is done with classical algorithms Alice & Bob can find out when Eve tries to eavesdrop.

Hacking Quantum Key Distribution systems QKD systems promise enhanced security. In fact, quantum cryptography is proveably secure. Surely one cannot eavesdrop on such systems, right?

Hacking QKD systems Security is easy to prove while assuming perfect apparatus and a noise-free channel. Those assumptions are not valid for practical systems e.g. Clavis2 from ID Quantique and QPN 5505 from MagiQ Technologies. Vulnerabilities thus appear.

Hacking by tailored illumination Lydersen et al. (2010) proposed a method to eavesdrop on a QKD system undetected. The hack exploits a vulnerability associated with the avalanche photo diodes (APD‘s) used to detect photons.

Avalanche photo diodes Can detect single photons when properly set. However, they are sensitive to more than just quantum states.

Modes of operation of APD’s Geiger and linear modes

Geiger mode V APD is usually fixed and called bias voltage and in Geiger mode, V bias > V br. An incident photon creates an electron-hole pair, leading to an avalanche of carriers and a surge of current I APD beyond I th. That is detected as a click. V bias is then made smaller than V br to stop flow of carriers. Subsequently it is restored to its original value in preparation for the next photon.

Linear mode V bias < V br. Detected current is proportional to incident optical power P opt. Clicks again occur when I APD > I th.

Operation in practical QKD systems V bias is varied as shown such that APD is in Geiger mode only when a photon is expected That is to minimize false detections due to thermal fluctuations. However, it is still sensitive to bright light in linear mode.

The hack in detail Eve uses an intercept-resend attack. She uses a copy of Bob to detect states in a random basis. Sends her results to Bob as bright light pulses, with peak power > P th, instead of individual photons. She also blinds Bob‘s APD‘s to make them operate as classical photodiodes only at all times to improve QBER.

The hack in detail C is a 50:50 coupler used in phase-encoded QKD systems. When Eve‘s and Bob‘s bases match, trigger pulse from Eve constructively interferes and hits detector corresponding to what Eve detected. Otherwise, no constructive interference and both detectors hit with equal energy. Click only observed if detected current > I th.

The hack in detail Clicks also only observed when Eve and Bob have matching bases. This means Eve and Bob now have identical bit values and basis choices, independently of photons emitted by Alice. However, half the bits are lost in the process of eavesdropping.

Performance issues? Usually, transmittance from Alice to Bob < 50%. APDs have a quantum efficiency < 50%. However, trigger pulses cause clicks in all cases. Loss of bits is thus compensated for and Eve stays undetected

Other methods Method presented is not the only known exploit. Zhao et al. (2008) attempted a time-shift attack. Xu et al. (2010) attempted a phase remapping attack.

Conclusion QKD systems are unconditionally secure, based on the fundamental laws of physics. However, physical realisations of those systems violate some of the assumptions of the security proof. Eavesdroppers may thus intercept sent messages without being detected.

Rev Mod Phys 74, 145 (2002) Physikalische Blätter 55, 25 (1999) Nature Photonics 4, 686 (2010) Experimental demonstration of phase-remapping attack in a practical quantum key distribution system. Xu et al. (2010) Hacking commercial quantum cryptography systems by tailored bright illumination. Lydersen et al. (2010) Quantum hacking: Experimental demonstration of time-shift attack against practical quantum-key-distribution systems. Zhao et al. (2008). Used Material