Fixing the rusty core of the internet with functional prog.
summary
Claims OpenSSL shows under 50% test coverage and dozens of high/critical vulnerabilities over the last decade, so types plus functional programming can encode elliptic curve math directly and make implementations readable and testable. A prototype implements finite fields and point arithmetic in Scala using Scala/Spire Fp type, expresses point multiplication in a Haskell-like style, and proves group laws with ScalaCheck. It is correct but currently slow and not constant-time, so it needs numeric and side‑channel hardening before production.
AI-written summary · about
chapters (11)
- 0:00Introduction and speaker
- 1:05Problems with OpenSSL
- 3:34Elliptic curves basics
- 6:25Elliptic curve cryptography
- 8:35Finite fields in crypto
- 11:46Code implementation overview
- 13:13Field and point types
- 15:46Group theory in crypto
- 16:51Testing and reasoning
- 18:16Why crypto is scary
- 19:19Call to action
related talks
59mModern, Functional Cryptography (Part 3)
58mKeynote: Why Functional Programming Matters
58mModern, Functional Cryptography (Part 6)
46mTesting in the world of Functional Programming
01h 44mFunctional Programming: Technical Reasons to Adapt
26mBuilding Private And Secure Applications Easily Using The Sunscreen FHE Compiler&Rust
55mModern, Functional Cryptography (Part 5)
43mThe Big Problems Facing Functional Programming & a Possible Solution