
Re: Is factorization of big primeproducts a solved problem YET?
Posted:
Jan 30, 2013 5:05 AM


On Thu, 10 Jan 2013 18:32:42 0800 (PST), Graham Cooper wrote: >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
it is not question of net of computer, one 1,000,000 core cpu could be the future in the next 210 years....
if the algo is parallelizable, as ECM, one can try to factor with that all number he want, so the computer with his power would win on algos

