Simons Institute for the Theory of Computing
@simonsinstitute
The world's leading venue for collaborative research in theoretical computer science. Follow us at YouTube.com/SimonsInstitute.
ID: 954510728181903361
http://simons.berkeley.edu 20-01-2018 00:27:46
1,1K Tweet
8,8K Takipçi
290 Takip Edilen
1/2 "To prove the existence of secure encryption, all we require is proving that P != NP. If P = NP, then we can break all of these primitives [fundamental algorithms used in cryptography]," said Rafael Pass (Rafael Pass) at the Simons Institute. Video: simons.berkeley.edu/talks/rafael-p…
![1/2 "To prove the existence of secure encryption, all we require is proving that P != NP. If P = NP, then we can break all of these primitives [fundamental algorithms used in cryptography]," said Rafael Pass (<a href="/PassRafael/">Rafael Pass</a>) at the Simons Institute. Video: simons.berkeley.edu/talks/rafael-p…](https://pbs.twimg.com/media/Gw6nzDlaoAAZiZB.jpg "Simons Institute for the Theory of Computing (@simonsinstitute) on Twitter photo 1/2 \"To prove the existence of secure encryption, all we require is proving that P != NP. If P = NP, then we can break all of these primitives [fundamental algorithms used in cryptography],\" said Rafael Pass (<a href=\"/PassRafael/\">Rafael Pass</a>) at the Simons Institute. Video: simons.berkeley.edu/talks/rafael-p…")