Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
impossiblefork
on Feb 14, 2025
|
parent
|
context
|
favorite
| on:
Why cryptography is not based on NP-complete probl...
Surely because of Goldreich & Wasserstein's result that public key encryption based on NP completeness necessitates NP=co-NP?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
