Introduction to Quantum Cryptography

Similar documents
An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata

5th March Unconditional Security of Quantum Key Distribution With Practical Devices. Hermen Jan Hupkes

+ = OTP + QKD = QC. ψ = a. OTP One-Time Pad QKD Quantum Key Distribution QC Quantum Cryptography. θ = 135 o state 1

Quantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security

Physics is becoming too difficult for physicists. David Hilbert (mathematician)

Research Proposal for Secure Double slit experiment. Sandeep Cheema Security Analyst, Vichara Technologies. Abstract

Transmitting and Hiding Quantum Information

Cryptography in a quantum world

10 - February, 2010 Jordan Myronuk

Quantum Cryptography

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.

High Fidelity to Low Weight. Daniel Gottesman Perimeter Institute

Cryptography CS 555. Topic 25: Quantum Crpytography. CS555 Topic 25 1

Quantum cryptography. Quantum cryptography has a potential to be cryptography of 21 st century. Part XIII

C. QUANTUM INFORMATION 111

LECTURE NOTES ON Quantum Cryptography

Ping Pong Protocol & Auto-compensation

Security Implications of Quantum Technologies

An Introduction. Dr Nick Papanikolaou. Seminar on The Future of Cryptography The British Computer Society 17 September 2009

A New Wireless Quantum Key Distribution Protocol based on Authentication And Bases Center (AABC)

Ph 219/CS 219. Exercises Due: Friday 3 November 2006

Chapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution

arxiv:quant-ph/ v2 2 Jan 2007

Problem Set: TT Quantum Information

C. QUANTUM INFORMATION 99

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

Secrecy and the Quantum

5. Communication resources

1. Basic rules of quantum mechanics

Lecture 4: Postulates of quantum mechanics

{0,1} = B versus a 0 +b 1 C 2

Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel

A probabilistic quantum key transfer protocol

Entanglement and Quantum Teleportation

Quantum Cryptography and Security of Information Systems

Lecture: Quantum Information

INTRODUCTION TO QUANTUM COMPUTING

Introduction to Quantum Mechanics

Quantum Cryptography applied to Electronic-Voting Protocols

EPR paradox, Bell inequality, etc.

Cryptographical Security in the Quantum Random Oracle Model

10. Physics from Quantum Information. I. The Clifton-Bub-Halvorson (CBH) Theorem.

Supplementary Material I. BEAMSPLITTER ATTACK The beamsplitter attack has been discussed [C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, J. Smol

Lecture 11 September 30, 2015

Uncertainty Principle

L7. Diffie-Hellman (Key Exchange) Protocol. Rocky K. C. Chang, 5 March 2015

A Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols

Lecture 1: Introduction to Public key cryptography

Network Security Based on Quantum Cryptography Multi-qubit Hadamard Matrices

1 1D Schrödinger equation: Particle in an infinite box

Enigma Marian Rejewski, Jerzy Róz ycki, Henryk Zygalski

A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels

Lecture 6: Quantum error correction and quantum capacity

CS/Ph120 Homework 1 Solutions

Quantum cryptography -the final battle?

Bit-Commitment and Coin Flipping in a Device-Independent Setting

An Introduction to Quantum Information and Applications

Lecture 1: Perfect Secrecy and Statistical Authentication. 2 Introduction - Historical vs Modern Cryptography

2. Introduction to quantum mechanics

arxiv:quant-ph/ v1 13 Mar 2007

Quantum Cryptography. Marshall Roth March 9, 2007

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Quantum Computers. Todd A. Brun Communication Sciences Institute USC

Quantum readout of Physical Unclonable Functions:

1 1D Schrödinger equation: Particle in an infinite box

Lecture 19: Public-key Cryptography (Diffie-Hellman Key Exchange & ElGamal Encryption) Public-key Cryptography

Unconditionally secure deviceindependent

Seminar Report On QUANTUM CRYPTOGRAPHY. Submitted by SANTHIMOL A. K. In the partial fulfillment of requirements in degree of

Quantum Simultaneous Contract Signing

Attacks against a Simplified Experimentally Feasible Semiquantum Key Distribution Protocol

Quantum Communication. Serge Massar Université Libre de Bruxelles

arxiv:quant-ph/ v2 17 Sep 2002

INTRODUCTORY NOTES ON QUANTUM COMPUTATION

Quantum Entanglement Assisted Key Distribution

The Relativistic Quantum World

Lecture #1. Review. Postulates of quantum mechanics (1-3) Postulate 1

A Refinement of Quantum Mechanics by Algorithmic Randomness and Its Application to Quantum Cryptography

APPLICATIONS. Quantum Communications

Instantaneous Nonlocal Measurements

A Matlab Realization of Shor s Quantum Factoring Algorithm

Quantum Information Types

Entanglement and information

Quantum Measurements: some technical background

arxiv:quant-ph/ v2 3 Oct 2000

Quantum Entanglement and Cryptography. Deepthi Gopal, Caltech

Quantum Cryptography

Quantum Gates, Circuits & Teleportation

CS/Ph120 Homework 8 Solutions

Lecture 28: Public-key Cryptography. Public-key Cryptography

Other Topics in Quantum Information

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2

Ground-Satellite QKD Through Free Space. Steven Taylor

Security Proofs for Quantum Key Distribution Protocols by Numerical Approaches

Quantum Cryptography

arxiv:quant-ph/ v1 13 Jan 2003

CS120, Quantum Cryptography, Fall 2016

Quantum Information Transfer and Processing Miloslav Dušek

Quantum Information Processing

Section 6: Measurements, Uncertainty and Spherical Symmetry Solutions

Transcription:

Università degli Studi di Perugia September, 12th, 2011 BunnyTN 2011, Trento, Italy This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License.

Quantum Mechanics End of 19th century: unexpected experimental results Quantum Mechanics: probabilistic physical theory based on an axiomatic mathematical formulation Von Neumann axiomatization by 4 postulates (we only take into account three in this presentation). Two main consequencies in respect to our concerns: 1 quantum information cannot be copied 2 measurements destroy information

Postulate 1 Physical system complex separable Hilbert space H State of a system class of normalized vectors: ψ H (bra-ket notation) Most elementary physical system: qubit (space dimension: 2)

Computational bases Different orthonormal bases can be given, e.g.:

Postulate 2 Conservation of energy: in an isolated system no energy can be created nor destroyed

The No-Cloning Theorem Landauer s principle: erasing information has an energy cost Information erased from the system = energy lost by the system So: quantum information in a closed physical system cannot be erased! No-Cloning theorem: quantum information cannot be copied (because to copy information somewhere one must first erase other information to allocate space)

Postulate 3 Physical observable Hermitian operator Possible outcomes of a measurement Eigenvalues of the associated observable Measurement of an observable A on a state ψ Probabilistic process which causes ψ to collapse on an eigenstate of A, with probability depending on ψ and A, and produces the corresponding eigenvalue as an outcome Computational basis in respect to a certain observable A: is an orthonormalized basis of A s eigenvectors

Example Suppose A has eigenstates and, with associated eigenvalues 0 and 1 Pr A (0 ) = 100% Pr A (1 ) = 0% Pr A (0 ) = 0% Pr A (1 ) = 100% recall: = 1 2 ( + ), while = 1 2 ( ) Pr A (0 ) = 50% Pr A (1 ) = 50% Pr A (0 ) = 50% Pr A (1 ) = 50%

Measurements So: measurements can destroy information (because once a state collapses we cannot recover the previous state) Why? Recall that Postulate 2 claims the impossibility of erasing information for an isolated system. Performing a measurement involves the interaction of the system with a measurement apparatus: the system is no more isolated! To observe is to disturb!

Spin The Spin is a quantized property of elementary particles. It is an observable, with the dimension of a magnetic angular momentum. We restrict to so-called spin- 1 particles, whose spin has only 2 two possible values (e.g.: spin up and spin down).

Spin along different directions Spin can be measured along different coordinate axes: each one is a different observable. These observables do not commute - this means that there is not a basis made of shared eigenvectors of the associated Hermitian operators. So for, e.g., two axes, we must choose two different computational bases:

Quantum Key Distribution In Secure Key Distribution two parties want to share a common encryption key over an insecure channel, to be used for subsequent encryption of the communication. (e.g.: Diffie-Hellmann) In Quantum Key Distribution (QKD) the goal is the same. The only difference is that in this cenario the two parties are also allowed to share quantum states.

BB84 Protocol - 1/7 Suppose Alice wants to share a secret key with Bob. They can use both a classical channel (where classical bits are exchanged) or a quantum channel (where qubits are exchanged - e.g., single spin- 1 particles are sent through the channel). 2 Both channels are insecure, and can be tampered by Eve

BB84 Protocol - 2/7 First of all, Alice and Bob agree on two different computational bases, e.g.: (, ) and (, ) Then, Alice chooses a sequence of basis elements picked at random among both bases elements and sends them to Bob through the quantum channel

BB84 Protocol - 3/7 For each qubit received, Bob chooses randomly one of two different measurement instruments (each one measuring either the observable related to the first computational basis or the other one) and performs measurements of the states Sometimes Bob chooses the correct instrument, sometimes not, receiving a random outcome

BB84 Protocol - 4/7 Then, Bob communicates to Alice (using the classical channel) the sequence of instruments he has used. Alice can then infere which of the states she has sent has been observed by Bob with the right instrument (50 % on average)

BB84 Protocol - 5/7 Finally, Alice communicates to Bob (through the classical channel) the right sequence of measurement instruments that had to be used. This allows Bob to know which of the states he measurede were a random outcome, and hence have to be discarded. He and Alice now both know (about) half of the initial sequence, and so they can use this sequence as a shared key to initiate a secure communication.

BB84 Protocol - 6/7 If Eve tries to eavesdrop the communication, she causes a state alteration every time she chooses a wrong measurement instrument (50 % of the times on average). So Bob receives a sequence of states that are already wrong by 50 % Notice that Eve cannot store a copy of the eavesdropped qubit prior of observing it, because of the no-cloning theorem

BB84 Protocol - 7/7 This means that Alice and Bob will end up with just a 25 % (on average) of correctly shared values, and are then able to spot Eve s presence and abort the communication! By increasing the number of qubits exchanged, the probability that Eve passes undetected can be made arbitrarily small

BB84 in practice BB84 has been successfully tested (and is currently used in some high-security bank and military systems), usually using polarized photons over a fibre channel as quantum states. BB84 is provably, unconditionally secure (as long as QM is correct) Known attacks to the protocol relies only on implementation issues (e.g.: measurement instruments can be temporarily blinded with strong laser pulses to produce wrong or noisy results)

End of this presentation Thanks for the attention tommaso[at]gagliardoni[dot]net