Modern, Functional Cryptography (Part 1)
summary
Mathematics-heavy developer introduction that actually states what gets built and proved: number theory, algebra, symmetric and asymmetric schemes, PRFs/PRGs, hashing, MACs, signatures, elliptic curves and ECDSA and ECEIS, plus TLS, tokens vs cookies and JWTs with code examples and implementations. The workshop develops a cryptographic library based on laws implemented with typeclasses, demonstrates why the one-time pad forces a key as long as the message, and reproduces concrete failures like padding Oracle attacks and poodle to show what breaks and why.
AI-written summary · about
chapters (20)
- 0:00Introduction
- 0:21About me
- 1:33Disclaimer
- 3:45Padding Oracle Poodle
- 6:37Maninthemiddle attack
- 8:38Disclaimers
- 10:12Not necessarily laws
- 14:00Symmetry
- 20:37Perfect secrecy
- 22:11Onetime pads
- 24:15Computational security
- 25:44Pseudorandom generators
- 27:53Stream ciphers
- 30:31Encryption over multiple messages
- 32:25Known plaintext attack
- 35:41Block ciphers
- 39:54Synchronized mode
- 42:26Thoughts on synchronized mode
- 43:51Block cipher modes
- 51:30Block cipher implementation
related talks
42mCryptography, hashing, encryption without the math
52mModern Cryptography for the Java Developer
48mCryptography for Beginners
01h 02mFrom Basic Idea to Impact: the story of modern cryptography
46mFrom substitutions to public keys - an introduction to cryptography
19mModern Cryptography & Implementation Flaws
51mBeyond cryptography
32mForay into modern symmetric crypto