Can Cryptography Survive If P=NP? Insights from Marshall Ball 🔐
Explore the implications of P=NP on cryptography with NYU's Marshall Ball. Discover whether secure communication remains possible if these fundamental computational questions are resolved. Join the discussion from the Spring 2023 Meet the Fellows event!
Simons Institute for the Theory of Computing
1.2K views • Jan 28, 2023
About this video
Marshall Ball (New York University)
https://simons.berkeley.edu/talks/cryptography-feasible-if-pnp
Meet the Fellows Welcome Event Spring 2023
https://simons.berkeley.edu/talks/cryptography-feasible-if-pnp
Meet the Fellows Welcome Event Spring 2023
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
1.2K
Likes
25
Duration
15:46
Published
Jan 28, 2023
User Reviews
4.5
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.