On Apr 22, 6:18 pm, Robert Gerbicz <robert.gerb...@gmail.com> wrote:
> 2009/4/22 Cactus <rieman...@googlemail.com>
>
>
>
>
>
> > On Apr 22, 5:40 pm, gerrob <robert.gerb...@gmail.com> 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.
Thaanks Robert, that is most helpful. I am sure your contribution
will be looked at for inclusion in a future release.
Brian
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"mpir-devel" group.
To post to this group, send email to mpir-devel@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
-~----------~----~----~----~------~----~------~--~---
