Xref: utzoo sci.math:3477 sci.crypt:1037
Path: utzoo!mnetor!uunet!husc6!rutgers!princeton!phoenix!schoen
From: schoen@phoenix.Princeton.EDU (Eric R Schoenberg)
Newsgroups: sci.math,sci.crypt
Subject: Re: New Factorization Records
Message-ID: <2675@phoenix.Princeton.EDU>
Date: 26 Apr 88 02:30:11 GMT
References: <7535@boring.cwi.nl>
Reply-To: schoen@phoenix.Princeton.EDU (Eric R Schoenberg)
Organization: Princeton University, NJ
Lines: 10
Keywords: 4,6,8,9,10,12,14,15,16,18,...

I have a question about how you rate the algorithms for factoring large numbers.
Is it chance that your program factored in such a relatively short time?  Or
can you gurantee a solution after a certain (reasonable) amount of time.  Can
you provide an average amount of time for factoring numbers of length n?
I am asking because you say that you used general purpose algorithms and I'm
not sure what you mean by general.

Thank you.

Randy Schoenberg