Modern, Functional Cryptography (Part 6)
summary
Math-heavy developer intro that actually shows working code and attacks: a cryptographic library built around typeclasses and laws with keys tracked by types, a key generator in IO but pure sign functions, and a worked exercise implementing a transaction chain with signatures serialized to JSON and verifiable. Demonstrations include practical attacks (a CBC padding Oracle and POODLE downgrade/exfiltration), ECC arithmetic over a small field (mod 11), and recommendations for modern primitives like XSalsa20‑Poly1305 and Curve25519.
AI-written summary · about
chapters (10)
- 0:00Start
- 0:18Cbc Mode of Operation
- 8:23Rsa as a Digital Signature Scheme
- 12:36Elliptic Curves
- 25:11The Elliptic Curve Discrete Logarithm Problem
- 28:28Elliptic Curve Addition Algorithm
- 29:16Elliptic Curve Digital Signature Algorithm
- 41:02Negligible Function
- 44:39Tests of Vectors
- 50:21Password Hashes
related talks
32mForay into modern symmetric crypto
52mModern Cryptography for the Java Developer
55mThe secrets of Cryptography
46mFrom substitutions to public keys - an introduction to cryptography
52mCryptography 101 for Java developers
25mCryptography Isn't Scary
42mCryptography, hashing, encryption without the math
42mEverything I always wanted to know about crypto