|Bill Allombert on Thu, 25 May 2000 21:54:12 +0200 (MET DST)|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
>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? No it is trivial, and I have already done it but it requires change in the factorization machinery to allow stopping before complete factorization is done.I have sent them to Gerhard Niklasch for checking. I can send you diffs of my version. Bill.