|
|
Re: Is factorization of big primeproducts a solved problem YET?
Posted:
Jan 10, 2013 9:32 PM
|
|
On Jan 4, 3:01 pm, JT <jonas.thornv...@gmail.com> wrote:
> Does the RSA challenges have a given time complexity of factoring the
> primeproduct, or did they have one that changed during resent years?
Polynomial or there abouts!
This is "Engineering Solvable"
n^2
whereas 2^n is considered "unsolvable"
that's why it becomes impossible after 1000 bits long numbers.
The NSA has a BUILDING SIZED PARALLEL COMPUTER with something like
1,000,000 PC's worth of processing power, so they can factor 10X
bigger than a Uni computer can!
Herc
|
|
