Talks
I have given guest lectures on cryptography and information security more broadly. A common theme in my talks is making cryptography approachable and exciting to newcomers to the field (e.g. advanced high schoolers, undergraduates, etc.). Cryptography brings me great joy, and I hope to share the fun with as many people as possible.
In reverse-chronological order.
Introduction to cybersecurity (a defender's perspective) [slides]
Guest lecture presented at Stevens Institute of Technology (CS101, Fall semester 2024)
Cryptography: modern-day magic [slides]
Guest lecture presented at University of British Columbia (CPSC 436s, Spring semester 2024)
Errata
- slide 32 states that Shamir Secret Sharing can be performed using the integers "modulo a prime or a power of a prime" as the underlying field. For prime $p$ and integer $k > 0$, the integers modulo $p^k$ are a field only for $k = 1$. Therefore, the second part of the quote is wrong; SSS cannot be done using the integers modulo an arbitrary power of a prime.
- slide 61 claims an entropy loss of ~1.4 bits per 8 bits for an SSS implementation with a particular flaw. This is likely incorrect, though I haven't had a chance to sit down and do the math :)