More Secrets of Cryptography
summary
Refresher plus concrete takeaways: AES and RSA limitations lead to elliptic curve key exchange (Curve25519 / lib sodium) for smaller keys; SHA‑2 (SHA‑256) details and Merkle trees for integrity; Bitcoin proof‑of‑work uses adjustable difficulty and provides a public timestamping layer. Practical verdict: most apps do not need a full blockchain — instead publish hash to Bitcoin or use signed Merkle chains and multi‑key policies. Quantum threats prompt migration to post‑quantum algorithms.
AI-written summary · about
chapters (21)
- 0:00Intro
- 0:38Why do I need cryptography
- 1:56Confidentiality
- 5:33Symmetric vs Asymmetric
- 9:00Elliptic Curve Cryptography
- 12:53Curve Cryptography
- 14:29Curve Key Exchange
- 18:09Web of Trust
- 21:35Can you trust
- 23:11Hash functions
- 27:23SHA2 family
- 28:18SHA256
- 29:56prescient function
- 32:03Merkle tree
- 32:35Hash tree
- 34:36Merkle hash tree
- 35:32Bitcoin
- 35:57Blockchain
- 37:41How Bitcoin works
- 39:50Why do Bitcoins have value
- 44:14Questions
related talks
01h 02mFrom Basic Idea to Impact: the story of modern cryptography
40mAsymmetric Encryption: A Deep Dive
19mPost-Quantum Cryptography
42mEverything I always wanted to know about crypto
58mKeynote: Crypto means Cryptography!
46mFrom substitutions to public keys - an introduction to cryptography
46mAchieving Quantum Readiness: A Comprehensive Approach
37mFrontiers in Cryptography