* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download pptx
Survey
Document related concepts
Relativistic quantum mechanics wikipedia , lookup
Cryptanalysis wikipedia , lookup
Computational chemistry wikipedia , lookup
Renormalization wikipedia , lookup
Renormalization group wikipedia , lookup
Scalar field theory wikipedia , lookup
Mathematical physics wikipedia , lookup
Path integral formulation wikipedia , lookup
Quantum field theory wikipedia , lookup
Natural computing wikipedia , lookup
Theoretical computer science wikipedia , lookup
Uncertainty principle wikipedia , lookup
Quantum computing wikipedia , lookup
Quantum machine learning wikipedia , lookup
Quantum group wikipedia , lookup
Transcript
Quantum Cryptography Dominique Unruh Dominique Unruh 3 September 2012 Organization • Lecture: Tuesday 10.15am • Practice: Wednesday 10.15am – Problem solving as a group • (sometimes switched) • Homework: Due after approx. one week • 50% needed for exam Dominique Unruh 2 Organizatorial • Black board lecture (except today) • Material: – Board photos – Lecture notes (short) – Book: Nielsen, Chuang, “Quantum Computation and Quantum Information” (not required) • Deregistering: Not after deadline Dominique Unruh 3 Scope of the lecture • No physics (almost) – Do you need electrodynamics to understand Turing-machines? – Mathematical abstraction of quantum computation/communication • Intro to Quantum computation/communication • Selected topics in quantum crypto Dominique Unruh 4 Requirements • No physics needed • Some crypto background recommended – (To have a context / the big picture) • Some linear algebra will be used – You should not be afraid of math – Can do recap during tutorial ask!!! Dominique Unruh 5 Organizatorial • Questions? Dominique Unruh Quantum Mechanics Dominique Unruh 7 Double Slit Experiment • Light falls through two slits (S2) • Light-dark pattern occurs • Reason: Light is a wave → Interference Dominique Unruh Quantum Cryptography 8 Double Slit Experiment • Send a single photon at a time • Photon either goes through left or right path • After a while, interference pattern occurs • Each photon “interferes with itself” → Physicists puzzled • Solution: Quantum mechanics: – Photon takes both ways in superposition Dominique Unruh Quantum Cryptography 9 Superposition • If two situations are possible, nature “does not always decide” – Both situations happen “in superposition” – (Doesn’t need to make sense now) • Only when we look, “nature decides” • Schrödinger’s cat Dominique Unruh Quantum Cryptography 10 Quantum Mechanics • Superposition: Several things happen “at once” • Our intuition is classical, we cannot understand this • Mathematical notions allow to handle QM, even if we do not understand it Dominique Unruh Quantum Cryptography 11 Quantum Computing Dominique Unruh 12 Church-Turing Thesis • Turing: Definition of Turing-machines • Church-Turing thesis: Any physically computable function can be computed by a Turing machine → Turing-Machine characterises physical computability Usually: Efficient = polynomial-time Dominique Unruh 13 Randomized algorithms • 1970s: Solovay-Strassen primality test • No deterministic test known (at that time) • Polynomial identity: No deterministic test today Any efficiently physically computable function can be computed by an efficient Turing machine Dominique Unruh 14 Enters: The Quantum Computer • Strong Church-Turing extended once – Perhaps has to be extended again • Feynman 1982: – Simulating quantum systems difficult for TMs – Quantum system can simulate quantum system • Probabilistic Church-Turing thesis wrong? – Unknown so far… But seems so… Dominique Unruh 15 Quantum Algorithms • Deutsch-Jozsa 1992: – Testing whether function is balanced or constant – No practical relevance – Shows: Quantum Computers more powerful than classical • Shor 1994: – Factorization of integers • Grover 1996: – Quadratic speed-up of brute-force search Dominique Unruh 16 Today • No quantum computers (except for toy models) • Cannot execute quantum algorithms • Future will tell Dominique Unruh 17 Quantum Cryptography Dominique Unruh 18 Quantum Key Exchange • Bennet, Brassard 1984: – Key exchange using quantum communication • Idea: – Measurement destroys state → Adversary cannot eavesdrop unnoticed Dominique Unruh 19 Quantum Key Exchange Alice Bob Polarisation: Measures Sends basis Shared key bits Dominique Unruh 20 Quantum Key Exchange – Attack Alice Bob Caution: This is only the intuition. Changed by measurement Security analysis much more involved. Polarisation: (Took 12 additional years…) Adversary measures → Bit destroyed → Alice+Bob: different keys → Attack detected Dominique Unruh 21 Quantum Key Exchange • Idea proposed 1984 • First security proof: Mayers 1996 • Possible with today’s technology – Single photon sources – Polarisation filters • No complexity assumptions – Impossible classically • Details later in lecture Dominique Unruh 22 Quantum Cryptography • Any cryptography using quantum – Key exchange – Bit commitment – Oblivious transfer – Zero knowledge – Signatures • Often: Quantum Crypto = Key Exchange – Other applications often ignored Dominique Unruh 23 End of Intro Dominique Unruh 24