The foundations of cryptography

What makes this fascinating

• Security rests on a bet — Modern encryption assumes certain problems (like factoring) are hard — but that has never been proven.

• It needs more than P ≠ NP — Even proving P ≠ NP wouldn't by itself guarantee that secure cryptography is possible.

• Quantum threatens it — Shor's algorithm would break today's public-key crypto, driving the race for post-quantum schemes.

Frequently asked questions

What are the foundations of cryptography?

Modern encryption assumes certain problems — like factoring large numbers — are computationally hard. The foundational question is whether we can prove they truly are, which so far we cannot.

Is encryption provably secure?

Mostly no. Most security rests on unproven hardness assumptions; if P = NP or efficient algorithms were found, much of today's cryptography would collapse.

How does quantum computing threaten cryptography?

Shor's algorithm lets a large quantum computer break widely used schemes like RSA, which is why 'post-quantum' cryptography is now being standardized.

More summits in Computer Science

• Artificial general intelligence

  Can a machine match the full, flexible breadth of human thought — and how would we know?

• Quantum computing's true power

  Which problems can quantum machines crack that ordinary computers never will?

• AI interpretability

  We build neural networks we can't read. Can we ever truly understand what they learn inside?

• Provably correct software

  Can we ever write software proven, mathematically, to be free of bugs and exploits?