crypto exchanges
8:38Diffie-Hellman Key Exchange
938K views • 14 years ago
Art of the Problem
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.
5:06How secure is 256 bit security?
3.7M views • 9 years ago
3Blue1Brown
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.
8:34Was YOUR vote counted? (feat. homomorphic encryption) - Numberphile
198K views • 10 years ago
Numberphile
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.
16:36Hacking at Quantum Speed with Shor's Algorithm | Infinite Series
238K views • 9 years ago
PBS Infinite Series
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.
10:58DON'T Buy a Used Mining GPU! - $h!t Manufacturers Say
3.7M views • 5 years ago
Linus Tech Tips
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.
10:58Flaw in the Enigma Code - Numberphile
5.4M views • 13 years ago
Numberphile
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.
17:31How Quantum Computers Break Encryption | Shor's Algorithm Explained
3.4M views • 7 years ago
minutephysics
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.
5:24Diffie-Hellman Key Exchange
547K views • 14 years ago
Art of the Problem
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.
12:24Elliptic Curve Back Door - Computerphile
554K views • 8 years ago
Computerphile
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.
9:48Bitcoin Q&A: How Do I Secure My Bitcoin?
117K views • 9 years ago
aantonop
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.