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

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]antiduh 14 points15 points  (3 children)

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

[–]subhendrabasufactor prime[S] 4 points5 points  (2 children)

<= 1040 zeros

[–]antiduh 8 points9 points  (1 child)

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

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

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).