Classical Cryptography

How do you communicate securely over a public channel?

Using a shared secret key! (Symmetric key encryption)

Let ciphertext CC, plaintext PP, and key KK be Strings of bits {0,1}\{0,1\}^*. Let EE be an encryption function and DD be a decryption function.

C=E(P,K)C=E(P, K) P=D(C,K)P=D(C, K)

There are three people Alice, Bob and Eve where Alice is trying to send data to Bob over a public channel and Eve is listening to it and maliciously trying to obtain the data.

How do we securely share the secret key KK in the first place? Classically we use RSA or Diffie-Hellman, but this relies on assumptions about hardness of a computational problem, which may not be hard for a quantum coputer.

In the quantum world, we use quantum key distribution (QKD) to securely share the secret key KK without Eve being able to intercept it.