crypto exchanges

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.

3Blue1Brown illustrates how enormous the 256-bit search space is, showing how infeasible it is to find a hash or key by guessing and checking.

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.

WIRED has UCLA professor Amit Sahai explain zero-knowledge proofs to a child, a teen, a college student, a grad student and an expert. Each round goes deeper into the cryptography and why it matters.

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 explains why hold music sounds worse than it used to, tracing it to old telephone exchanges and the audio compression applied by modern switches. It is a short visit to the Milton Keynes Museum.

Linus Tech Tips looks at whether buying a used GPU that was previously used for crypto mining is a good idea, as miners prepare to sell off cards. The video discusses how mining affects wear on cards and what to watch for.

3Blue1Brown explains the math and mechanics behind Bitcoin visually: ledgers, digital signatures, proof of work and the blockchain, building up a decentralized payment system from first principles.

Numberphile's Dr James Grime explains the flaw in the Enigma machine, namely that a letter could never be encrypted to itself, and how that helped the Allies break the code. It touches on the Bombe and Alan Turing.

A step-by-step animated explanation of how SHA-256 works, from padding and message schedule to the compression function and final hash, with source code for the animations.

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 Art of the Problem clip explaining Diffie-Hellman key exchange, using a paint mixing analogy for one-way functions and touching on modular arithmetic and discrete logarithms.

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.

Dr Mike Pound explains the suspected backdoor in the Dual_EC_DRBG random number generator and how elliptic curve constants could let someone predict its output.

Benn Jordan investigates infrasound and low-frequency noise from data centers, including xAI's Colossus and a crypto mine, and reports his own experiments on the effects. The video covers the health and community impacts on nearby residents.

Dr Mike Pound of Computerphile shows how a modern laptop can crack Enigma, using a ciphertext-only attack based on an older paper. He compares it with the tooling in CrypTool.

Huygens Optics shows through a laser interference experiment that the question of a photon's size is really about coherence length. It argues that photons exist as energy exchanges between radiation and matter, not as little particles in free space.

Andreas Antonopoulos answers a question about how to secure your Bitcoin. He covers holding your own keys, backing up the 12 to 24 word seed phrase, and the tradeoffs of custodial accounts, phone wallets and hardware wallets.