On Fri, Dec 4, 2009 at 12:29 PM, Bill Hart <goodwillh...@googlemail.com> wrote: > Whoah, it just does trial division up to 1000 then uses a *single* > *random* base for a strong pseudoprime test! > > I have a definite problem with this. What is the probability of > returning a composite? Assuming the factors are bigger than 1000, it > is like 1/4.
How fast is your BPSW code? From that project I have been working on I have confirmed there are no psp's up to 2^64 using BPSW so that should work quite well after the trial division assuming it doesn't take too long to run. Or we could even use the BPSW code from Thomas R. Nicely since he already gave us permission to use it for the benchmark code if it is faster than your implementation. Jeff. -- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-de...@googlegroups.com. To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en.
