Cryptography in a Quantum World

2015/10/14 by Gilles Brassard · 1 voice
Computer Science · Physics and Astronomy · #Blessing #Chaos-based Image/Signal Encryption #Computability, Logic, AI Algorithms #Computer science #Computer security #Cryptography #Einstein #Philosophy #Physics #Quantum #Quantum Mechanics and Applications #Quantum computer #Quantum cryptography #Quantum information #Quantum mechanics #Theoretical physics #cs.CR #quant-ph

paper · pdf · doi:10.1007/978-3-662-49192-8_1

arxiv published 2015/10/14 · arxiv updated 2015/10/14 · openalex publication_date 2016/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Although practised as an art and science for ages, cryptography had to wait until the mid-twentieth century before Claude Shannon gave it a strong mathematical foundation. However, Shannon's approach was rooted is his own information theory, itself inspired by the classical physics of Newton and Einstein. But our world is ruled by the laws of quantum mechanics. When quantum-mechanical phenomena are taken into account, new vistas open up both for codemakers and codebreakers. Is quantum mechanics a blessing or a curse for the protection of privacy? As we shall see, the jury is still out!

Citations

• Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
• Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP
• Information-theoretic security proof for quantum-key-distribution protocols
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• A Mathematical Theory of Communication
• Use of Elliptic Curves in Cryptography
• Strengths and Weaknesses of Quantum Computing
• Brief History of Quantum Cryptography: A Personal Perspective
• Quantum mechanical computers
• Quantum cryptography: Public key distribution and coin tossing
• Tight Bounds on Quantum Searching
• Elliptic curve cryptosystems
• A single quantum cannot be cloned
• Quantum cryptography based on Bell’s theorem
• Communication Theory of Secrecy Systems*
• On the Einstein Podolsky Rosen paradox
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Full-field implementation of a perfect eavesdropper on a quantum cryptography system
• Quantum theory, the Church–Turing principle and the universal quantum computer
• New directions in cryptography
• Simulating physics with computers
• Conjugate coding
• The Codebreakers: The Comprehensive History of Secret Communication from Ancient Times to the Internet
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A method for obtaining digital signatures and public-key cryptosystems
• Elliptic Curve Cryptosystems
• Post-Quantum Cryptography

Discussions

• Cryptography in a Quantum World [hn, 1 points, 0 comments]