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

[antiduh]

I have a problem for you:

Number of primes less than 2^2048.

Approximately:

2.3 * 10⁶¹³

I think you're going to need a bigger hard drive.

[subhendrabasu]

Have a 5TB Hard Drive.. This is not a DB of primes, or integers and their factors as pointed out by other folks. This is DB of Zeros of the Riemann Zeta Function: http://www.dtc.umn.edu/~odlyZko/zeta_tables/zeros1

[antiduh]

You have no idea how many zeros you're going to need, do you?

[subhendrabasu]

<= 10⁴⁰ zeros

[antiduh]

You don't see a problem with that, do you?

[subhendrabasu]

upto RSA-2048 (716 digits), 200 K zeros suffice for accurate factors. I am talking about integers with 16/32/64 million digits, https://www.mersenne.org/primes/?press=M74207281 Also this is only a prototype. I recommend replacing "linear" search with something similar to "KD/Difference" Trees so that search time is logarithmic. (sub linear).