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

I wouldn't worry so much. RSA is based on the integer factorization problem . Hypothetically if you figured out any pattern in the distribution of prime numbers it would help in the factorization but there has been about hundreds of years of research in this direction and it is a extremely hard problem. Even if this was solved we could always move to ECC encryption like curve22519

Sources http://cr.yp.to/ecdh.html http://en.wikipedia.org/wiki/Riemann_hypothesis http://en.wikipedia.org/wiki/RSA_problem

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