homomorphic encryption

Numberphile interviews cryptographer Ron Rivest about end-to-end verifiable voting. He explains how homomorphic encryption and receipts let a voter confirm their ballot was counted without being able to prove how they voted to anyone else.

A five-minute CGP Grey explainer arguing that a phone is effectively an extension of your mind, and that any backdoor or master key into encrypted devices will inevitably be abused or leaked. It frames the encryption debate as locks that are either unbreakable or absent.

MinutePhysics explains Shor's algorithm, showing how a quantum computer factors large integers by finding the period of a number modulo N. It walks through the modular arithmetic and number theory that give the exponential speedup over classical factoring, and why this threatens encryption.

A short explainer on the history and mechanics of public key cryptography and the Diffie-Hellman key exchange. It uses a mixing-paint-colors analogy to show how two parties can agree on a shared secret in public.

PBS Infinite Series explains how Shor's algorithm lets a quantum computer break RSA encryption, building on earlier episodes about cryptography and the math of quantum computers. It works through the idea step by step.

Tom Scott visits Cloudflare's San Francisco office to show the wall of lava lamps whose camera feed is used as a source of entropy for random number generation. It is a short explainer on how this helps secure internet encryption.