Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

But, is it proven that RSA is secure? Wouldn't that also prove P != NP?


Haha, well it does depend on the assumption that integer factorisation is hard. Although I'm not sure that being able to do it implies P = NP.




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

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

Search: