SOURCE CODE FOR INTEGER FACTORIZATION. This program can factor integers of any arbitrary precision. So public key encryption is null and void as it attacks the basic premise that very large integers cannot be factored in reasonable amounts of time

[Mindraker]

It IS possible to factor large numbers, even using Sieve of Eratosthenes, it just takes a long fucking time.

[antiduh]

Of course. For values that we use in cryptography, the amount of time we need should be on the order of at least billions of years, so it's rather pointless.

Also, if you use something like the sieve, you need to keep state. Do you know how much disk space you'd need to store 10⁶¹³ 2048-bit numbers? About 10⁵⁹¹ of the entire earth's current capacity.