Modern, Functional Cryptography (Part 5)
summary
Workshop promises a mathematics-heavy, developer-first route: concrete claims about hardness (Fermat little theorem, discrete logarithm, Diffie‑Hellman) and explicit attacks and algorithms (Shanks baby‑step giant‑step, Pollard p−1, difference‑of‑squares factorization), with code examples and a plan to develop a cryptographic library expressed with typeclasses and runnable demos of ECDSA and TLS deployment. Exercises and full proofs are listed but may be skipped for time; expect worked examples, number‑theory proofs, and practical caveats about RSA vs elliptic curves.
AI-written summary · about
chapters (9)
- 0:00Start
- 2:45Math Exercises
- 11:46The Discrete Logarithm Problem
- 20:11Hardness
- 21:32Group Order
- 26:28Rsa and Integer Factorization
- 27:25Rsa
- 36:56Break Rsa
- 52:20Digital Signatures
related talks
01h 02mFrom Basic Idea to Impact: the story of modern cryptography
42mCryptography, hashing, encryption without the math
37mFrontiers in Cryptography
40mAsymmetric Encryption: A Deep Dive
52mMore Secrets of Cryptography
46mFrom substitutions to public keys - an introduction to cryptography
52mAsymmetric Encryption: A Deep Dive
52mModern Cryptography for the Java Developer