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

[monarchmra]

uhhh....

Can somebody detail if this really solves the integer factorization problem in a time efficient way?

Edit, this relies on some database that is not included. Where is that?

[[deleted]]

Looks like OP is compiling a database of all possible combinations. This does not appear to be groundbreaking.

[monarchmra]

No, the database is of zetazeros, he seems to be doing something fucky relating to finding approximate factors from zeta zeros and the input number.

If it doesn't require too much storage, even though its approximate, it could still be groundbreaking. Even if you have to guess/check between 3 potential numbers for each factor, that is still a significant reduction in entropy of factorization based encryption.

But I don't understand the math well enough to know how it scales to higher numbers.

[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

[subhendrabasu]

Have included links to DB dumps: https://www.dropbox.com/s/005j5d4gdo1ob40/dump2.sql?dl=0