Igor Schein on Thu, 25 May 2000 15:48:11 -0400


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Pocklington-Lehmer 

Hi,

How hard is it to go from the current implementation of primality
proving ( CVS version ) which requires complete factorization of P-1,
to the point where partial factorization is sufficient?  Will it
require to implement an entirely different algorithm?

Thanks

Igor