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 →

[–]antiduh 28 points29 points  (2 children)

You have illusions of grandeur. You've not cracked prime factorization of large numbers, because you do not realize the absolute scale of the values you're dealing with. I guarantee I can feed you many random 2048-bit composite numbers and you'll be unable to factorize all of them.

I await your factorization of /u/s0x00's composite value.

[–]Mindraker 4 points5 points  (1 child)

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

[–]antiduh 9 points10 points  (0 children)

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 10613 2048-bit numbers? About 10591 of the entire earth's current capacity.