Everything I always wanted to know about crypto
summary
Starts from a single-byte XOR demo (256 possible keys, trivially brute-forceable) and shows why AES uses 16-byte blocks, 10–14 rounds and keys 128/192/256; demonstrates why ECB leaks structure and how CBC and CTR/nonce or GCM fix it while introducing risks like bit‑flip tampering and padding oracle attacks. Covers RSA (2048–4096 bits) vs Diffie‑Hellman/ephemeral and elliptic curve for forward secrecy, recommends pyca/cryptography’s Fernet and testing with SSL Labs; warns of BREACH/CRIME and key/side‑channel pitfalls.
AI-written summary · about
chapters (37)
- 0:00Intro
- 0:36About me
- 1:04I am poor at mathematics
- 1:18Finding better resources
- 2:02The best way to insult
- 2:44Bitwise operations
- 4:17Essential properties
- 6:44How AES works
- 8:59Electronic Codebook
- 12:35Pyketen
- 14:01Decryption
- 16:36Hash
- 16:55Properties
- 18:52Hashed
- 19:31GCM
- 20:12Symmetric
- 21:25RSA
- 25:37Forward Secrecy
- 26:35elliptic curve cryptography
- 27:17trust
- 27:50RSA encryption
- 28:48Certificate authorities
- 29:27Chain of trust
- 31:06TLS
- 32:16Cyber Suites
- 33:37SSL Encryption
- 34:50SSL Labs
- 36:07Fernet
- 37:21Cano PG
- 37:50Common Errors
- 38:27Authentication Code
- 38:40Confidentiality
- 38:58Handling keys
- 39:21Side channel vulnerabilities
- 40:00Crypto challenges
- 40:37Bulletproof SSL TLS
- 41:02Conclusion
