- This salon has passed.
They’re the same Picture: A Cryptographic Lens on Randomness
Tuesday May 2 at 5:00 pm - 6:30 pm CEST
Start time where you are: Your time zone couldn't be detected
Thor Kamphefner is an applied cryptographer and educator, specializing in zero knowledge and threshold schemes. Randomness exists all around us. In this salon, we'll explore the way randomness is exploited by cryptographers and mathematicians to build structure from entropy.
To distill structure from randomness may seem paradoxical, but protocols based in randomness are the bedrock for many schemes in cryptography. In this salon, we’ll present several cryptographic schemes based in randomness, including:
- Miller Rabin’s Scheme for Primality testing
- Perfect, Statistical, and Computational security
- The power of interactive proofs to prove statements in the complexity class NP
- Oblivous Transfer
And beyond! This salon will aim to be accessible to those with or without a mathematical background.
Miller Rabin section in https://explained-from-first-principles.com/number-theory/#miller-rabin-primality-test
Interactive Proofs https://en.wikipedia.org/wiki/Interactive_proof_system
oblivious transfer: https://en.wikipedia.org/wiki/Oblivious_transfer
Become a member, get a free ticket every month (FAQ), access our forums, members-only events, and more!