[Cado-nfs-discuss] RSA-180 Successfully Completed
rjd1212 at cox.net
Sat Mar 24 02:21:15 CET 2018
1) The reason I factored the previously factored, RSA-180 was because I initially wanted to test the robustness of the program after previously factoring RSA-130 through RSA-170 successfully. Unfortunately, when I got around running RSA-180, I had issues with the official cado-nfs-2.3.0 release. In fact, I had previously ran that very same RSA number 3 times only to have unexpected crashes in the sieving portion, or in the merging phase. That's when I decided to use one of the git versions - which proved to be successful.
2) Re: Danilov/Popovyan poly file - No, unfortunately I overlooked that optimized Danilov/Popovyan poly file for RSA-180, which is currently in the parameters/polynomials directory of the git version, but not in the official cado-nfs-2.3.0 release.
Instead, I used the c180 non RSA poly file. My bad.
> On March 23, 2018 at 9:30 AM paul zimmermann <Paul.Zimmermann at inria.fr> wrote:
> Dear Robert,
> > I have successfully factored RSA-180 using Git development version 23930bb.
> glad to see you have found the same factors as those already known!
> > The overall factoring time took a total of 32 days, employing one server &
> > nine clients, utilizing an imported poly file to save about 2 days of
> > polysieving, in addition to running a total of 88 threads for lattice
> > sieving, 16 threads for Krylov/Lingen/Mksol, Linear Algebra stage, & 8
> > threads for the sqrt run.
> did you use the same polynomial used by Danilov and Popovyan?
> It would be nice to compare with the polynomial found by CADO-NFS
> (after a few hours of sieving you can get a quite good estimate of the ETA).
> > Many thanks for your helpful pointers in factoring this particular RSA number
> > successfully.
> you are welcome.
> Paul Zimmermann
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Cado-nfs-discuss