Hacker News new | past | comments | ask | show | jobs | submit login

Yeah but in general this is basically impossible to predict we could discover P=NP, or prove the Riemmean Hypothesis, learn how to factor in O(log n), find a number theory method to solve discrete logs, or any number of math facts that would absolutely devastate Asymmetric crypto. In general is really hard to find strong crypto-systems let alone proving that the problem is unsolvable



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: