![]() |
|
|
#221 |
|
Feb 2013
2×229 Posts |
http://factordb.com/index.php?id=1100000000845191301
http://factordb.com/index.php?id=1100000000845194058 http://factordb.com/index.php?id=1100000000845176896 http://factordb.com/index.php?id=1100000000845188498 Last fiddled with by storflyt32 on 2016-06-27 at 18:44 |
|
|
|
|
|
#222 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
1075210 Posts |
That quote appears at the very end of my DPhil thesis, on a page which contains only those words and which, I suspect, very few noticed.
|
|
|
|
|
|
#223 |
|
Feb 2013
1CA16 Posts |
http://factordb.com/index.php?id=1100000000845535301
http://factordb.com/index.php?id=1100000000845871935 The two last factors in the first link after leaving the computer running. Continuing, why is not the C200 in the second link giving in since the first pair was a bit difficult? If one lock or keycode for some reason is a difficult one, the chance is that the second one could be more easy. But not this time. Is this perhaps of the starting point for the whole thing? For now I do not have the explanation here. Last fiddled with by storflyt32 on 2016-06-28 at 23:55 |
|
|
|
|
|
#224 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
947710 Posts |
Quote:
![]() Apparently we are witnessing the birth of a new cargo cult. It works like this: storflyt32 enters an essentially random number into factordb.com, then leaves his computer running and sometimes he really has to work hard, really hard, -- maybe for a few hours, sometimes for a day! ...and there, the number gets factored! Then it's time to report it to the scientific community! And then, "divide" factors "out of" the RSA number, and (you guessed it) ... enter the results into the database. And repeat! And repeat! You can laugh all you want, but he will be laughing last - when he finally gets RSA factored. It's too bad that this universe will not be here to see him laughing. |
|
|
|
|
|
|
#225 |
|
Feb 2013
2·229 Posts |
pfgw64 -q"((415066877765*2^666669-1)/195353728101)"
PFGW Version 3.7.7.64BIT.20130722.Win_Dev [GWNUM 27.11] ((415066877765*2^666669-1)/195353728101) is composite: RES64: [0C077517F3C5DE26] (2194.5976s+0.0062s) |
|
|
|
|
|
#226 |
|
Feb 2013
2×229 Posts |
http://factordb.com/index.php?id=1100000000848637889
I pressed ^C a little too hard and lost the factor. But it was a P43 or so and now it says 12.59 hours more to go. Perhaps I will know the answer before the end of the day. |
|
|
|
|
|
#227 |
|
Feb 2013
2×229 Posts |
http://factordb.com/index.php?id=1100000000848637889
Added the P43 by using nfs on the initial number after it once again ran out. In fact it ends up on its heels when it first breaks and next it becomes a bit tedious or time-consuming to recover properly. |
|
|
|
|
|
#228 |
|
Feb 2013
2×229 Posts |
|
|
|
|
|
|
#229 |
|
Feb 2013
2·229 Posts |
Not known when posting, but when starting up today, the C266 "divides" from the C1133 of 2^4096+1 with factors 2, 3,
P18 = 201769119713238983 and a PRP850. I could do the reporting a little bit later for this factorization, since we got the other side as well. Also could find time to walk down to the shop for the Saturday beer, which is not always that fun doing. Last fiddled with by storflyt32 on 2016-07-23 at 11:58 |
|
|
|
|
|
#230 |
|
Feb 2013
2×229 Posts |
http://factordb.com/index.php?id=1100000000851908087
http://factordb.com/index.php?id=1100000000851908294 Added this tonight. Perhaps we should have been better off already. |
|
|
|
|
|
#231 |
|
Feb 2013
2×229 Posts |
http://factordb.com/index.php?id=1100000000852465030
http://factordb.com/index.php?id=1100000000852465088 Added most of it in the second link above. But could tell that the factors for the first link also are being known individually. In fact, from my notes related to the factorization of RSA-768. P90 = 576055778090167509741809284694039277902832329387333828567411071717334361923831147451695693 P113 = 25589166898885508654766458077735343058690221562913013678743755072295083333225124814326892161139840020955987977931 If you are able to factorize the C203 and get these factors in return, you are probably quite good at what you are doing. For the record. Last fiddled with by storflyt32 on 2016-08-04 at 18:36 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Can Pollard Rho cycles be used to find a factor? | wwf | Factoring | 26 | 2013-09-30 04:24 |
| PFGW can't find a small factor. | Arkadiusz | Software | 7 | 2013-02-18 12:43 |
| Chance to find an n-digit factor with ECM | RedGolpe | Factoring | 4 | 2007-03-23 15:24 |
| How much ECM does it take to find a given factor? | geoff | Factoring | 5 | 2004-09-29 20:14 |
| Where I find the best program to it factor keys? I use AMD. | chrow | Factoring | 5 | 2004-02-19 10:15 |