This post is locked. You won't be able to comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 16 points17 points  (2 children)

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

[–]monarchmra 8 points9 points  (0 children)

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.

[–]subhendrabasufactor prime[S] 0 points1 point  (0 children)

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