4 ms·
The bigger implication is that if you know the frequency of prime numbers and have a way to calculate when to expect them the difficulty in calculating new larg
by drakaal 13y ago
The bigger implication is that if you know the frequency of prime numbers and have a way to calculate when to expect them the difficulty in calculating new large primes is greatly reduced. In effect the strength of all encryption based on Primes is greatly reduced.
BitCoin, PGP, HTTPS, Certs, all just got orders of magnitude easier to crack. Well not just... It will take a little bit for time to use this information to create optimizations for beating each of these. But soon.
- velis_vel 13y agoWhat? No. RSA doesn't depend on finding prime numbers, it depends on factoring large numbers, which is a completely separate problem. Elliptic curve cryptography doesn't depend on prime factorization at all. Even if they did, I don't think this really helps you; knowing that there exist arbitrarily many primes within N doesn't help you find primes any faster.
- drakaal 13y agoWhat do you think Factors are? Do you know what a Prime is? Do you know what a Factor Is? I am skipping the rest of your arguments since. "What, Yes" is more correct.