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

RSA cryptography is is based on the assumption that factoring numbers is a hard problem. Isn’t kind of nice to know that there curious people trying their best to see how fast you can actually get?


Primality tests for Mersenne numbers are highly specialized. It's possible that they could advance factorization of general numbers, but extremely unlikely.




Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10

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

Search: