On Wednesday 22 April 2009 18:18:06 Robert Gerbicz wrote: > 2009/4/22 Cactus <[email protected]> > > > On Apr 22, 5:40 pm, gerrob <[email protected]> wrote: > > > Hi! > > > > > > I've written a much faster code than the currently used in gmp/mpir. > > > Million of bits numbers can be tested in about 1 sec, but slower by a > > > factor of 2 up to about 1000 bits numbers on my pc. Tested a lot, it > > > should be good. > > > You can use it for whatever you want. I've sent it to Torbjorn > > > Granlund (main developer of gmp project) also. > > > > > > See the uploaded file in the google group, it's name newperfpow.c > > > > Thank you for your contribution, which looks very interesting. > > > > MPIR is released under the LGPL v2.1 license whereas your code is LGPL > > v3 licensed. > > > > Would you be willing to release it under a license that would allow > > MPIR to incorporate it? > > > > Thank you for your interest, which is much appreciated. > > > > Brian Gladman > > OK, I've changed the license, is it good now? > > The idea of using power residues to cancel many exponents at power testing > is an old method to avoid the Newton iteration. To do this we have to > compute many remainders, for this I'm using a remainder tree to speedup > this step. The strong Lehmer test is probably a new idea in this area. > Looks similar to GTM A course in computational number theory Algorithm 1.7.5 I expect we could use lucas pseudoprimes , or finite field ones as well
http://www.pseudoprime.com/pseudo/ If this is nothing like your algorithm though :) > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
