Quantum Minimalism in Cryptography 🔐
Mark Zhandry explores minimal complexity assumptions for quantum cryptography and one-way functions at NTT Research.
Simons Institute for the Theory of Computing
534 views • May 6, 2023
About this video
Mark Zhandry (NTT Research)
https://simons.berkeley.edu/talks/mark-zhandry-ntt-research-2023-05-05
Minimal Complexity Assumptions for Cryptography
One-way functions are often referred to as the “minimal” cryptographic assumption. Recent revelations that objects “below” one-way functions may be possible quantumly have sparked a scramble to find a new minimal quantum assumption. In this talk, I take a step back and explore what makes one-way functions minimal in the first place and what we should be searching for quantumly.
https://simons.berkeley.edu/talks/mark-zhandry-ntt-research-2023-05-05
Minimal Complexity Assumptions for Cryptography
One-way functions are often referred to as the “minimal” cryptographic assumption. Recent revelations that objects “below” one-way functions may be possible quantumly have sparked a scramble to find a new minimal quantum assumption. In this talk, I take a step back and explore what makes one-way functions minimal in the first place and what we should be searching for quantumly.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
534
Likes
12
Duration
34:01
Published
May 6, 2023