Lecture

Quantum Cryptography: Building Security in a Quantum World

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture explores the implications of quantum computing on cryptography, focusing on the potential vulnerabilities of current cryptosystems and the development of post-quantum cryptography. It covers the impact of quantum computers on factoring, the security of RSA encryption, and the need for quantum-hard cryptographic solutions. The lecture delves into the concept of cryptographic proof systems, including completeness, soundness, and zero-knowledge guarantees. It also discusses the challenges of achieving quantum-secure commitments and succinct proofs. The presentation concludes with a look at interactive cryptography in a quantum world and outlines future research directions in the field.

Official source

Ontological neighbourhood

Computer engineering

Computer security: Public-key cryptography

Theoretical computer science

Theory of computation: Quantum computing

Related concepts (32)

Quantum cryptography

Quantum cryptography is the science of exploiting quantum mechanical properties to perform cryptographic tasks. The best known example of quantum cryptography is quantum key distribution which offers an information-theoretically secure solution to the key exchange problem. The advantage of quantum cryptography lies in the fact that it allows the completion of various cryptographic tasks that are proven or conjectured to be impossible using only classical (i.e. non-quantum) communication.

Quantum computing

A quantum computer is a computer that exploits quantum mechanical phenomena. At small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior, specifically quantum superposition and entanglement, using specialized hardware that supports the preparation and manipulation of quantum states. Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster than any modern "classical" computer.

Cryptography

Cryptography, or cryptology (from κρυπτός "hidden, secret"; and γράφειν graphein, "to write", or -λογία -logia, "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others.

Post-quantum cryptography

In cryptography, post-quantum cryptography (PQC) (sometimes referred to as quantum-proof, quantum-safe or quantum-resistant) refers to cryptographic algorithms (usually public-key algorithms) that are thought to be secure against a cryptanalytic attack by a quantum computer. The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem.

Cryptographic primitive

Cryptographic primitives are well-established, low-level cryptographic algorithms that are frequently used to build cryptographic protocols for computer security systems. These routines include, but are not limited to, one-way hash functions and encryption functions. When creating cryptographic systems, designers use cryptographic primitives as their most basic building blocks. Because of this, cryptographic primitives are designed to do one very specific task in a precisely defined and highly reliable fashion.

Related lectures (64)

Efficient Post-Quantum Commutative Group Action

Explores the CSIDH algorithm, a post-quantum cryptographic scheme based on isogenies, discussing its history, inner workings, and security.

Quantum Key Distribution: Security and Implementation

Explores Device Independent Quantum Key Distribution (DIQKD) principles, security proofs, and experimental demonstrations against quantum computer threats.

Cryptography Basics

Covers authentication, authorization, encryption techniques, vulnerabilities, and the impact of quantum computing on cryptography.

Quantum Key Distribution: Security and Applications

By the instructor Nicolas Sangouard explores Quantum Key Distribution, its vulnerabilities to quantum computers, and the importance of secure key distribution protocols.

Quantum Cryptography: Key Generation Protocol