Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
eru
on Aug 16, 2010
|
parent
|
context
|
favorite
| on:
GetACoder.com: Solve P Vs NP
Actually, it's quite hard to come up with good primes for RSA. They need to avoid lots of properties, because researches have found efficient attacks on numbers with those properties.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: