![]() |
![]() |
#56 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
9,973 Posts |
![]()
There is no "vulnerability" as in the sense of a backdoor or math trick or something. It is just that the computers became so fast that they are able to factor a 512 bits number (about 154 digits) in a reasonable amount of time, with the current state-of-the-art software tools. And when I say "reasonable" I am thinking hours, or days. I can do it at home with the hardware I currently have and yafu, in (much) less than a week, and I do not have very advanced computers. And I save the ~$100 required by the EC2 cluster in the script you linked.
The fun part is that many of the guys here on this forum can do it faster, even if they work individually, i.e. not putting their resources in common. Last fiddled with by LaurV on 2022-05-06 at 05:02 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Breakthrough in Very Large Integer factorization? | jpcu1237 | Tales From the Crypt(o) | 18 | 2020-07-16 22:23 |
Methods of attacking a large factorization | CRGreathouse | Factoring | 55 | 2014-04-11 15:05 |
An equivalent problem for factorization of large numbers | HellGauss | Math | 5 | 2012-04-12 14:01 |
Fermat numbers factorization | ET_ | Factoring | 15 | 2008-03-12 21:24 |
How do I get LARGE numbers | Bundu | Software | 5 | 2004-08-26 01:56 |