Current group: sci.crypt
Re: Surrogate factoring approach, analysis
|
|
 | | From: | Lits O'Hate | | Subject: | Re: Surrogate factoring approach, analysis | | Date: | 21 Jan 2005 10:37:52 -0800 |
|
|
 | jstevh@msn.com wrote: > > 137305167623353 > > ( 11173213 12288781 ) > > Whew! It's taking a lot longer now as the program really isn't built > for large numbers, yet. It's a proof of concept prototype not built > for speed. > > I was worried it might not factor any numbers of this size. > > Most of the time is taken with factoring T, the surrogate, and it's > possible that it's not decomposing it fully, but it got at least one. > > Each factorization is taken a few minutes now...
By way of comparison, using Cygwin on my 2.66Ghz XP box, the "factor" command correctly factors 137305167623353 in 202 milliseconds.
|
|
|
| | |
|
 |