TLS Cryptography for Programmers
summary
Explains exactly how TLS handshakes and ciphers work, showing a 10‑bit RSA demo, why real RSA uses montgomery multiplication (about 500× speedup) and why most public exponents are 65537, with a failed 1024‑bit try to connect to Google until optimized. Measures attacker power (a hobbyist ~2^39 ops/s, nation‑scale centuries to crack RSA‑2048 ≈112‑bit security), exposes RNG/Heartbleed failures that leak private keys, and advocates TLS 1.3 simplifies choices.
AI-written summary · about
chapters (36)
- 0:00Start
- 6:02Identification
- 6:40Asymmetric Cryptography
- 7:01Rsa
- 7:20Remote Login
- 8:43Remainder after Division
- 13:52Discrete Logarithm
- 17:10Montgomery Montgomery Multiplication
- 18:46Where Do You Get Prime Numbers
- 19:33Hardware Random Number Generators
- 21:22Windows Rand Function
- 22:16Diffie-Hellman
- 26:27Elliptic Curves to Rsa
- 27:21Hashing
- 30:34Adversaries
- 32:54Birthday Attack
- 35:42Merkle Dem Guard Construct
- 38:21Sponge Construct
- 39:23Passwords and Hashing
- 41:43Common Passwords
- 46:27Key Stretching
- 49:31Certificates
- 52:09Symmetric Cryptography
- 56:02Perfect Encryption
- 58:19Stream Cipher
- 58:41Block Ciphers
- 59:02Counter Mode
- 1:01:45What Is a Secure Connection
- 1:03:03Sslv3
- 1:04:05Tls 1 2
- 1:06:49Tls Cipher Strings
- 1:08:23Why Is It So Hard To Implement
- 1:15:42Constant Time Computation
- 1:20:57Playstation 3
- 1:23:37Is There a Ongoing Arms Race with Cryptography
- 1:23:58Quantum Cryptography Breakthrough
related talks
45mUnlocking The Secrets Of TLS
44mSSL/TLS for Mortals
46mFrom substitutions to public keys - an introduction to cryptography
01h 00mCS Fundamentals: Why SSL and SSH are Secure
42mCryptography, hashing, encryption without the math
55mUnlocking The Secrets Of TLS
50mSSL/TLS for Mortals
58mKeynote: Crypto means Cryptography!