Modern, Functional Cryptography (Part 3)
summary
Math-heavy workshop that actually builds things: a typed cryptography library in Scala using cats/fs2/http4s and tsec (libsodium for FFI), implements Merkle trees and a simple blockchain with proof-of-work (demo finds nonce 607), contrasts SHA‑1 demo hashes with scrypt or argon 2 recommended for password hashing, explains memory‑hard KDFs and rainbow‑table attacks, shows how Merkle‑Damgård and collision/preimage properties matter, and ships runnable code with live failures and fixes so the examples actually execute.
AI-written summary · about
chapters (8)
- 0:00Start
- 2:14Compression Function
- 2:38Collision Resistance
- 4:30Preimage Resistance
- 5:10Second Preimage Resistance
- 9:40Password Hashes
- 11:17Key Derivation Function
- 15:24Proof of Work
related talks
20mFixing the rusty core of the internet with functional prog.
34mUnlocking the unknowns: Cryptography Essentials
52mMore Secrets of Cryptography
52mCryptography 101 for Java developers
37mFrontiers in Cryptography
42mCryptography, hashing, encryption without the math
25mCryptography Isn't Scary
48mCryptography 101 for Java developers